2026-08-16T23:13:52Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5886 2024-03-06T10:37:07Z ddc:004 open_access

Loopless Gray Code Enumeration and the Tower of Bucharest Herter, Felix Rote, Günter Tower of Hanoi Gray code enumeration loopless generation 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Felix Herter and Günter Rote 2016 Is Part Of LIPIcs, Volume 49, 8th International Conference on Fun with Algorithms (FUN 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FUN.2016.19 urn:nbn:de:0030-drops-58863 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.19 eng https://creativecommons.org/licenses/by/3.0/legalcode