Generalizations of the Hanoi Towers Problem

Simple item page
dc.creatorBenditkis, Sergey
dc.creatorSafro, Illya
dc.date2006-12-13
dc.date.accessioned2026-07-07T07:34:29Z
dc.date.available2026-07-07T07:34:29Z
dc.descriptionOur theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goal is to find an optimal (shortest possible) sequence of discs' moves. Besides that, we will research all versions of 3-pegs classical problem with some special constraints, when some types of moves are disallowed.
dc.identifierhttps://arxiv.org/abs/cs/0612070
dc.identifierhttp://arxiv.org/abs/cs/0612070
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119784
dc.subjectDiscrete Mathematics
dc.titleGeneralizations of the Hanoi Towers Problem
dc.typetext

Files

Collections

arXiv