<--- Back to Details
First PageDocument Content
Technology / Tower of Hanoi / Peg / CLIÉ / Mechanical puzzles
Date: 2013-08-03 19:54:21
Technology
Tower of Hanoi
Peg
CLIÉ
Mechanical puzzles

Choosing the PEG+ or C/PEG Libraries A Technical Whitepaper James A. DeLisle Kenneth G. Maxwell Swell Software, Inc.

Add to Reading List

Source URL: www.smxrtos.com

Download Document from Source Website

File Size: 97,97 KB

Share Document on Facebook

Similar Documents

SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin

SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin

DocID: 1tF3N - View Document

ON THE FRAME-STEWART ALGORITHM FOR THE TOWER OF HANOI MICHAEL RAND 1. Introduction The Tower of Hanoi puzzle was created over a century ago by the number theorist

ON THE FRAME-STEWART ALGORITHM FOR THE TOWER OF HANOI MICHAEL RAND 1. Introduction The Tower of Hanoi puzzle was created over a century ago by the number theorist

DocID: 1sQUR - View Document

Psychological Science, in press  Gesture changes thought by grounding it in action S.L. Beilock & S. Goldin-Meadow Department of Psychology, The University of Chicago

Psychological Science, in press Gesture changes thought by grounding it in action S.L. Beilock & S. Goldin-Meadow Department of Psychology, The University of Chicago

DocID: 1pkwy - View Document

Psychological Science, in press  Gesture changes thought by grounding it in action S.L. Beilock & S. Goldin-Meadow Department of Psychology, The University of Chicago

Psychological Science, in press Gesture changes thought by grounding it in action S.L. Beilock & S. Goldin-Meadow Department of Psychology, The University of Chicago

DocID: 1pb9K - View Document

RecapRecursion .........

RecapRecursion .........

DocID: 1m33m - View Document