Goal-directed cognition is often discussed in terms of specialized memory structures like the “goal stack.” The goal-activation model presented here analyzes goal-directed cognition in terms of the general memory constructs of activation and associative priming. The model embodies three predictive constraints: (1) the interference level, which arises from residual memory for old goals; (1) the ...

The notion that memory for goals is organized as a stack persists as a central feature of cognitive theory, in that stacks are primitive mechanisms in leading cognitive architectures. However, the stack construct over-predicts the strength of goal memory and the precision of goal selection order, while under-predicting the maintenance cost of both. A better approach to understanding cognitive g...

The coordination of speech with gesture elicits changes in speakers' problem-solving behavior beyond the changes elicited by the coordination of speech with action. Participants solved the Tower of Hanoi puzzle (TOH1); explained their solution using speech coordinated with either Gestures (Gesture+Talk) or Actions (Action+Talk), or demonstrated their solution using Actions alone (Action); then ...

One of the most well-known CNF benchmark encodes the problem of the Towers of Hanoi. This benchmark is available from SATlib and has been part of the set of problem instances used in more than one edition of the SAT competition. The existing CNF instances build upon an encoding using the STRIPS language. Although the available instances (ranging from 4 to 6 disks) are hard to solve for most of ...

Heuristic functions for single-agent search applications estimate the cost of the optimal solution. When multiple heuristics exist, taking their maximum is an effective way to combine them. A new technique is introduced for combining multiple heuristic values. Inspired by the evaluation functions used in two-player games, the different heuristics in a singleagent application are treated as feat...

Unfortunately, the original version of this supplement [1] contained errors in two of the abstracts; P037 and P127. Please see details below. In P037, the image presented as Figure eight is incorrect. The correct figure is shown below (Fig. 1). In P127, the author list presented is incorrect. The correct author list is as below. R Iqbal; Y Alhamdi; N Venugopal; S Abrams; C Downey; CH Toh; ID We...

Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computing the length of the shortest path. The key element is a finite-state machine which decides, after examining on the average only a small number of the largest discs (asymptotically, 63 38 ≈ 1.66), whether the largest disc will be moved once or twice. ...

The famous game Towers of Hanoi is related with a family of so–called Hanoi–graphs. We regard these non self–similar graphs as geometrical objects and obtain a sequence of fractals (HGα)α converging to the Sierpiński gasket which is one of the best studied fractals. It is shown that this convergence holds not only with respect to the Hausdorff distance, but that also Hausdorff dimension does co...

In this paper, two versions of an iterative loopless algorithm for the classical towers of Hanoi problem with O(1) storage complexity and O(2) time complexity are presented. Based on this algorithm the number of different moves in each of pegs with its direction is formulated. Keywords—Loopless algorithm, Binary tree, Towers of Hanoi.