Back to Results
First PageMeta Content



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
Add to Reading List

Document Date: 2014-02-10 20:43:55


Open Document

File Size: 220,29 KB

Share Result on Facebook