9 citations · 12 across the 8 of their papers we have counts for
1 paper · 1 filter
Dan Romik
We present efficient algorithms for constructing a shortest path between two states in the Tower of Hanoi graph, and for computing the length of the shortest path. The key element…