Weakest calculator/pocket computer that can do Tower of Hanoi?

[Thomas Okken]

(08-13-2018 01:38 AM)Paul Dale Wrote:  Anyway, here is a 49 step programme for the HP 25 that gives the solution to an n level Tower of Hanoi problem:

[...]

The program will display a sequence of two digits numbers that represent the poles moved between, pick the legal move in each case.

Lame. Why don't you just admit you don't know how to do this on the HP-25? Just like Thomas K., who also seems to think he's coded a solution even though he didn't, and like me, who coded a solution that is complete but is too long to fit.