selected publications

• academic article

  • A note on the Frame–Stewart conjecture.  Discrete Mathematics, Algorithms and Applications.  2019
  • Computational Solution of an Old Tower of Hanoi Problem.  Electronic Notes in Discrete Mathematics.  2016
  • Sierpiński graphs as spanning subgraphs of Hanoi graphs.  Open Mathematics.  11. 2013
  • Graph Theory of Tower Tasks.  Behavioural Neurology.  25:13-22. 2012
  • Graph theory of tower tasks..  DOAJ (DOAJ: Directory of Open Access Journals).  2012
  • A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles.  Information Sciences.  179:2934-2947. 2009
  • The iso-effect: Is there specific learning of Tower of London iso-problems?.  Thinking & Reasoning.  15:237-249. 2009
  • Metric properties of the Tower of Hanoi graphs and Stern’s diatomic sequence.  European Journal of Combinatorics.  26:693-708. 2005
  • Shortest paths between regular states of the Tower of Hanoi.  Information Sciences.  63:173-181. 1992
  • Pascal's Triangle and the Tower of Hanoi.  American Mathematical Monthly.  99:538-544. 1992
  • The average distance on the Sierpiński gasket.  Probability Theory and Related Fields.  87:129-138. 1990
  • An iterative algorithm for the Tower of Hanoi with four pegs.  Computing.  42:133-140. 1989

• book

  • The Tower of Hanoi – Myths and Maths 2018

• chapter

  • Tower of Hanoi Variants with Restricted Disc Moves.  Springer eBooks. 2018
  • Tower of Hanoi Variants with Oriented Disc Moves.  . 2013