We show that anagram-free vertex colouring a $2\times n$ square grid requires number of colours increases with $n$. This answers an open question in Wilson's thesis and shows there are even graphs pathwidth $2$ do not have colourings bounded colours.

The purpose of these studies was to explore the role of effort in remembering anagrams and their solutions. In Experiment 1, we compared the effects on memory of copying words, typing them as solutions for easy anagrams, or typing them as solutions for difficult anagrams. Solving anagrams involved more effort than did simply typing words, as indexed by response time. However, this effort facili...

The pervasive use of cell phones impacts many people-both cell phone users and bystanders exposed to conversations. This study examined the effects of overhearing a one-sided (cell phone) conversation versus a two-sided conversation on attention and memory. In our realistic design, participants were led to believe they were participating in a study examining the relationship between anagrams an...

Although connectionist models have provided insights into the nature of perception and motor control, connectionist accounts of higher cognition seldom go beyond an implementation of traditional symbol-processing theories. We describe a connectionist constraint satisfaction model of how people solve anagram problems. The model exploits statistics of English orthography, but also addresses the i...