Test | |||||||||||||||
How to find optimal solution for 9 puzzle problem ? try this small DOS program : http://geocities.datacellar.net/psarnack/bidiC.zip syntax: c:>BidiC.exe 57410386 123456780 Where each block is identified by number and "0" is reserved for empty position. for example : C:\tst>bidiC.exe 574103286 123456780 -----Next Node---- 1 2 3 4 5 6 7 8 0 -----Next Node---- 1 2 3 4 5 6 7 0 8 -----Next Node---- 1 2 3 4 0 6 7 5 8 -----Next Node---- 1 0 3 4 2 6 7 5 8 -----Next Node---- 0 1 3 4 2 6 7 5 8 -----Next Node---- 4 1 3 0 2 6 7 5 8 -----Next Node---- 4 1 3 2 0 6 7 5 8 -----Next Node---- 4 1 3 2 5 6 7 0 8 -----Next Node---- 4 1 3 2 5 6 0 7 8 -----Next Node---- 4 1 3 0 5 6 2 7 8 -----Next Node---- 4 1 3 5 0 6 2 7 8 -----Next Node---- 4 1 3 5 0 6 2 7 8 -----Next Node---- 4 0 3 5 1 6 2 7 8 -----Next Node---- 0 4 3 5 1 6 2 7 8 -----Next Node---- 5 4 3 0 1 6 2 7 8 -----Next Node---- 5 4 3 1 0 6 2 7 8 -----Next Node---- 5 4 3 1 7 6 2 0 8 -----Next Node---- 5 4 3 1 7 6 2 8 0 -----Next Node---- 5 4 3 1 7 0 2 8 6 -----Next Node---- 5 4 0 1 7 3 2 8 6 -----Next Node---- 5 0 4 1 7 3 2 8 6 -----Next Node---- 5 7 4 1 0 3 2 8 6 ------ The End----- |
|||||||||||||||
My Favorite Links: | |||||||||||||||
Yahoo! | |||||||||||||||
Yahoo! Greetings | |||||||||||||||
My Info: | |||||||||||||||
Name: | Piotr S | ||||||||||||||
Email: | psarnack@yahoo.com | ||||||||||||||