Results 131 to 140 of about 1,241 (174)
Some of the next articles are maybe not open access.
A Concurrent Approach to the Towers of Hanoi
1990The tower of Hanoi problem has long been known to have a closed (ie non-recursive) solution. In this paper we analyse two approaches to this solution which involve concurrency. This is not an end in itself, but serves to introduce the main ideas and notations of CAP (Communicating Asynchronous Processes) — a revision of CSP which the authors have used ...
W. David Crowe, Peter E. D. Strain-Clark
openaire +1 more source
Restricted Towers of Hanoi and Morphisms
2005The classical towers of Hanoi have been generalized in several ways. In particular the second named author has studied the 3-peg Hanoi towers with all possible restrictions on the permitted moves between pegs. We prove that all these Hanoi puzzles give rise to infinite morphic sequences of moves, whose appropriate truncations describe the transfer of ...
Jean-Paul Allouche, Amir Sapir
openaire +1 more source
ACM SIGPLAN Notices, 1985
Another nonrecursive algorithm for The towers of Hanoi Problem is presented. It serves to compute the disk configuration from a given move number and the disk to be moved together with its current peg and target. The procedure gives rise to detect faults in erroneous computations.
openaire +1 more source
Another nonrecursive algorithm for The towers of Hanoi Problem is presented. It serves to compute the disk configuration from a given move number and the disk to be moved together with its current peg and target. The procedure gives rise to detect faults in erroneous computations.
openaire +1 more source
2017
This chapter discusses one of the great classics of recreational math—the Tower of Hanoi. The Tower of Hanoi was introduced in 1883 by Le Professeur N. Claus (de Siam), Mandarin du College Li-Sou-Stian. He was later revealed to be French mathematician Éduard Lucas, born in Amiens, France, in 1842 and teaching at the Lycée Saint-Louis in 1883.
openaire +1 more source
This chapter discusses one of the great classics of recreational math—the Tower of Hanoi. The Tower of Hanoi was introduced in 1883 by Le Professeur N. Claus (de Siam), Mandarin du College Li-Sou-Stian. He was later revealed to be French mathematician Éduard Lucas, born in Amiens, France, in 1842 and teaching at the Lycée Saint-Louis in 1883.
openaire +1 more source
1998
Abstract concern perhaps more prevalent among logicians than among mathematicians in general is that the formal axioms chosen for set theory lead to a contradiction. Further, possible inconsistency has been a frequent point in the criticism of the study of large cardinals in general.
openaire +1 more source
Abstract concern perhaps more prevalent among logicians than among mathematicians in general is that the formal axioms chosen for set theory lead to a contradiction. Further, possible inconsistency has been a frequent point in the criticism of the study of large cardinals in general.
openaire +1 more source
2013
This chapter describes the classical TH with three pegs. In the first section, the original task to transfer a tower from one peg to another is studied in detail. We then extend our considerations to tasks that transfer discs from an arbitrary regular state to a selected peg. We further broaden our view in Section 2.4 to tasks transforming an arbitrary
Andreas M. Hinz +3 more
openaire +1 more source
This chapter describes the classical TH with three pegs. In the first section, the original task to transfer a tower from one peg to another is studied in detail. We then extend our considerations to tasks that transfer discs from an arbitrary regular state to a selected peg. We further broaden our view in Section 2.4 to tasks transforming an arbitrary
Andreas M. Hinz +3 more
openaire +1 more source
The towers of Hanoi problem with parallel moves
Information Processing Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jer-Shyan Wu, Rong-Jaye Chen
openaire +1 more source
The four-peg Tower of Hanoi puzzle
ACM SIGCSE Bulletin, 1991We discuss a version of the Tower of Hanoi puzzle in which there are four pegs rather than three. The fourpeg puzzle provides a rich source of exercises (samples of which are included) for students after the familiar three-peg version has been presented.
I-Ping Chu, Richard Johnsonbaugh
openaire +1 more source
Generalized sequencing problem “Towers of Hanoi”
Zeitschrift für Operations Research, 1985For \(p\in N\) certain integer-valued functions \(A_ p(x)\), defined for \(x\in N\cup \{0\}\), are studied. These functions occur in a functional equation system corresponding to a generalized version of the transportation game ''Towers of Hanoi'' and their values may be interpreted as minimum numbers of moves. An explicit representation of \(A_ p(x)\)
openaire +2 more sources