#7770: Implement Tower of Hanoi graph
----------------------------+-----------------------------------------------
Reporter: rbeezer | Owner: rlm
Type: enhancement | Status: new
Priority: minor | Milestone: sage-4.3.1
Component: graph theory | Keywords: tower of hanoi graph
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
The Tower of Hanoi puzzle can be described by a graph whose vertices are
possible states of the disks on the pegs, with edges represdenting
legitimate moves of a single disk.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7770>
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.
