A Representation Approach to the Tower of Hanoi Problem
Copyright policy )A Representation Approach to the Tower of Hanoi Problem
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.
- University of Wollongong Australia
tower of Hanoi algorithm, Applications of computability and recursion theory, representation approach, General topics in the theory of software, bit-string representation, Gray codes, Enumerative combinatorics, Game theory
tower of Hanoi algorithm, Applications of computability and recursion theory, representation approach, General topics in the theory of software, bit-string representation, Gray codes, Enumerative combinatorics, Game theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).25 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!