2hnemarrow@kuhub.cc.ukans.edu (04/12/91)
I was just sitting here and wondering if someone might know what the worst case and maximum number of moves it takes for a 3X3 sliding tile puzzle. I'd like to know for a modulae 2 progarm I'm writing <-- (duh). _________________ | | | | | 1 | 2 | 3 | |_____|_____|_____| E-mail would be best, I think. Thanks in advance, | | | | | 4 | 5 | 6 | |_____|_____|_____| 2hnemarrow@kuhub.cc.ukans.edu | | | | | 7 | 8 | 9 | |_____|_____|_____|
2hnemarrow@kuhub.cc.ukans.edu (04/12/91)
> _________________ > | | | | > | 1 | 2 | 3 | > |_____|_____|_____| > | | | | > | 4 | 5 | 6 | > |_____|_____|_____| > | | | | > | 7 | 8 | | <--- Sorry for the inconvenience, but one tile was > |_____|_____|_____| supposed to be empty. Thanks again.