Traza de solución por pasos para 4 discos en las torres de Hanoi
Initializing TOL OIS: versión implementada: 02.03
TowerHanoi.Recursive make: begin
TowerHanoi.Recursive make: test
Hanoi:
=|= | |
==|== | |
===|=== | |
====|==== | |
Disk 4: 1->3
Disk 3: 1->2
Disk 2: 1->3
Disk 1: 1->2
Hanoi:
| | |
==|== | |
===|=== | |
====|==== =|= |
Hanoi:
| | |
| | |
===|=== | |
====|==== =|= ==|==
Disk 1: 2->3
Hanoi:
| | |
| | |
===|=== | =|=
====|==== | ==|==
Hanoi:
| | |
| | |
| | =|=
====|==== ===|=== ==|==
Disk 2: 3->2
Disk 1: 3->1
Hanoi:
| | |
| | |
=|= | |
====|==== ===|=== ==|==
Hanoi:
| | |
| | |
=|= ==|== |
====|==== ===|=== |
Disk 1: 1->2
Hanoi:
| | |
| =|= |
| ==|== |
====|==== ===|=== |
Hanoi:
| | |
| =|= |
| ==|== |
| ===|=== ====|====
Disk 3: 2->3
Disk 2: 2->1
Disk 1: 2->3
Hanoi:
| | |
| | |
| ==|== =|=
| ===|=== ====|====
Hanoi:
| | |
| | |
| | =|=
==|== ===|=== ====|====
Disk 1: 3->1
Hanoi:
| | |
| | |
=|= | |
==|== ===|=== ====|====
Hanoi:
| | |
| | |
=|= | ===|===
==|== | ====|====
Disk 2: 1->3
Disk 1: 1->2
Hanoi:
| | |
| | |
| | ===|===
==|== =|= ====|====
Hanoi:
| | |
| | ==|==
| | ===|===
| =|= ====|====
Disk 1: 2->3
Hanoi:
| | =|=
| | ==|==
| | ===|===
| | ====|====
Torres 4: 0 secs
TowerHanoi.Recursive make: end
Ha sido incluido el fichero E:/Asc/App/TowerHanoi.Recursive/make.tol [0.155 sec.]
TowerHanoi.Recursive soluciona de forma recursiva el problema de las Torres de Hanoi
2015 asolver.com | Aviso legal | XHTML | Δ Θ Ξ | Creative Commons | Mapa y funciones del sitio