The Cyclic Towers of Antwerpen problem - A challenging Hanoi variant
暂无分享,去创建一个
[1] Amir Sapir,et al. The Tower of Hanoi with Forbidden Moves , 2004, Comput. J..
[2] M. C. Er,et al. Towers of Hanoi with Black and White Discs , 1985 .
[3] Sandi Klavzar,et al. The Tower of Hanoi - Myths and Maths , 2013 .
[4] Shay Solomon,et al. On Optimal Solutions for the Bottleneck Tower of Hanoi Problem , 2007, SOFSEM.
[5] Steven Minsker,et al. The Little Towers of Antwerpen problem , 2005, Inf. Process. Lett..
[6] Daniel Berend,et al. The cyclic multi-peg Tower of Hanoi , 2006, TALG.
[7] Shay Solomon,et al. Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem , 2008, TALG.
[8] Mario Szegedy,et al. In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved? , 1999, STACS.
[9] M. C. Er,et al. The Complexity of the Generalised Cyclic Towers of Hanoi Problem , 1985, J. Algorithms.
[10] Steven Minsker,et al. The Towers of Antwerpen Problem , 1991, Inf. Process. Lett..
[11] Steven Minsker,et al. The linear twin Towers of Hanoi problem , 2007, SGCS.
[12] M. C. Er,et al. The Generalized Colour Towers of Hanoi: An Iterative Algorithm , 1984, Comput. J..
[13] Daniel Berend,et al. The Tower of Hanoi problem on Pathh graphs , 2011, Discret. Appl. Math..
[14] Mike D. Atkinson,et al. The Cyclic Towers of Hanoi , 1981, Inf. Process. Lett..
[15] M. C. Er,et al. A generalization of the cyclic towers of hanoi: an iterative solution , 1984 .