114
click to vote
TALG
2008
15 years 2 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...