|
Revision 1204, 492 bytes
(checked in by jmaessen, 22 months ago)
|
|
Reasonably efficient aStar implementation. Solves one square at a
time (currently the one with highest branching factor), rather than
trying all square redundantly at every level.
|
| Line | |
|---|
| 1 | 000000012008030000000000040120500000000004700060000000507000300000620000000100000 |
|---|
| 2 | 000000012050400000000000030700600400001000000000080000920000800000510700000003000 |
|---|
| 3 | 000000012300000060000040000900000500000001070020000000000350400001400800060000000 |
|---|
| 4 | 000000012400090000000000050070200000600000400000108000018000000000030700502000000 |
|---|
| 5 | 000000012500008000000700000600120000700000450000030000030000800000500700020000000 |
|---|
| 6 | 123456789456......789......2........5........8........3.....8976.....3219.....654 |
|---|
