文章基本信息

标题：Loopless Gray Code Enumeration and the Tower of Bucharest
本地全文：下载
作者：Felix Herter ; G{\"u}nter Rote
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2016
卷号：49
页码：19:1-19:19
DOI：10.4230/LIPIcs.FUN.2016.19
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We give new algorithms for generating all n-tuples over an alphabet of m letters, changing only one letter at a time (Gray codes). These algorithms are based on the connection with variations of the Towers of Hanoi game. Our algorithms are loopless, in the sense that the next change can be determined in a constant number of steps, and they can be implemented in hardware. We also give another family of loopless algorithms that is based on the idea of working ahead and saving the work in a buffer.
关键词：Tower of Hanoi; Gray code; enumeration; loopless generation