A Representation Approach to the Tower of Hanoi Problem | Zendy

M. C. Er | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Representation Approach to the Tower of Hanoi Problem

Author(s) -

M. C. Er

Publication year - 1982

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/25.4.442

Subject(s) - tower , representation (politics) , string (physics) , bit (key) , computer science , algorithm , bit array , arithmetic , theoretical computer science , mathematics , structural engineering , engineering , mechanical engineering , drilling , computer security , politics , political science , law , mathematical physics

By making the moving direction of each disc explicit in the representation, a bit-string so constructed can be used to drive the Tower of Hanoi algorithm. The behaviour of disc moves is further analysed based on the bit-string representation. It has been shown that the bit-string for moving n discs can be used to generate successively the Gray codes of n bits.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research