A loopless approach for constructing a fastest algorithm for the towers of hanoi problem (Q3802653): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207168608803530 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2149370323 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Towers of Hanoi Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discussion and correspondence: A note on the Towers of Hanoi problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The towers of Hanoi revisited: Moving the rings by counting the moves / rank | |||
Normal rank | |||
Latest revision as of 18:12, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A loopless approach for constructing a fastest algorithm for the towers of hanoi problem |
scientific article |
Statements
A loopless approach for constructing a fastest algorithm for the towers of hanoi problem (English)
0 references
1986
0 references
iteration
0 references
loopless algorithm
0 references
Towers of Hanoi
0 references
0 references
