File:HaToSbS-3-1.svg
Size of this PNG preview of this SVG file: 354 × 177 pixels. Other resolutions: 320 × 160 pixels | 640 × 320 pixels | 1,024 × 512 pixels | 1,280 × 640 pixels | 2,560 × 1,280 pixels.
Original file (SVG file, nominally 354 × 177 pixels, file size: 5 KB)
Captions
Captions
Add a one-line explanation of what this file represents
Summary
| Description | A file showing a single stage in the minimal solution algorithm for the Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in this category. |
| Date | 07:54, 4 May 2023 (UTC) |
| Source | own drawing |
| Author | chris 論 |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 07:54, 4 May 2023 | | 354 × 177 (5 KB) | Chrkl (talk | contribs) | {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [... |
You cannot overwrite this file.
File usage on Commons
The following page uses this file:
