File:Tower of Hanoi-4 Longest Cycle.svg
Size of this PNG preview of this SVG file: 660 × 560 pixels. Other resolutions: 283 × 240 pixels | 566 × 480 pixels | 905 × 768 pixels | 1,207 × 1,024 pixels | 2,414 × 2,048 pixels.
Original file (SVG file, nominally 660 × 560 pixels, file size: 11 KB)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
| Description |
English: Graph of the Hamiltonian cycle for the 3-disk en:Tower of Hanoi puzzle. Created by User:Brhaspati using Inkscape, based upon prior related work by en:User:Nonenmac. |
| Date | (UTC) |
| Source | |
| Author |
|
I, the copyright holder of this work, hereby publish it under the following licenses:
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
You may select the license of your choice.
Original upload log
This image is a derivative work of the following images:
- File:Tower_of_Hanoi-3_Longest_Path.svg licensed with Cc-by-3.0, Cc-by-3.0
- 2008-07-11T15:57:53Z File Upload Bot (Magnus Manske) 660x560 (7896 Bytes) {{BotMoveToCommons|en.wikipedia}} {{Information |Description={{en|Graph of the longest non-repeating path between pegs '''''a''''' and '''''b''''' for the 3-disk [[:en:Tower of Hanoi]] puzzle. Created by me using Adobe Illu
Uploaded with derivativeFX
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 23:42, 3 January 2009 | | 660 × 560 (11 KB) | Brhaspati | {{Information |Description={{en|Graph of the Hamiltonian cycle for the 3-disk en:Tower of Hanoi puzzle. Created by User:Brhaspati using Inkscape, based upon prior related work by en:User:Nonenmac.}} |Source=*[[:File:Tower_of_Hanoi-3_Longest |
File usage
No pages on the English Wikipedia use this file (pages on other projects are not listed).
Global file usage
The following other wikis use this file:
- Usage on sq.wikipedia.org
- Usage on sr.wikipedia.org
- Usage on zh.wikipedia.org
