#7770: Implement Tower of Hanoi graph
----------------------------+-----------------------------------------------
Reporter: rbeezer | Owner: rlm
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-4.3.1
Component: graph theory | Keywords: tower of hanoi graph
Work_issues: | Author: Rob Beezer
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Changes (by newvalueoldvalue):
* status: new => needs_review
* author: => Rob Beezer
Comment:
Some rough timing information on a 3 GHZ Core 2 Duo:
4 pegs, 10 disks, no labels, no layout info
{{{2^20 = 1,048,576}}} vertices[[BR]]
3,142,656 edges[[BR]]
240 seconds
Distance between vertex 0 and {{{(4^10)-1}}}, ie[[BR]]
the minimum number of moves to solve the puzzle:[[BR]]
742 ms
I could probably provide timing on sage.math for a release tour (along
with a nice graphic).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7770#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
