search

daniel-centore / amity-apcs-ge-2011

Automatically exported from code.google.com/p/amity-apcs-ge-2011
0 stars 0 forks source link

Small puzzles aren't solved optimally #10

Closed GoogleCodeExporter closed 9 years ago

GoogleCodeExporter commented 9 years ago 
With brute force set to depth 8 for the 5x5 puzzle (it takes a maximum of 8 
moves to solve it), it takes 11 moves to solve it.  The first step shows that 
the correct sequence of moves was found, but that sequence changes for the next 
step.  Solving this problem could improve the performance for the end 
situations.

Original issue reported on code.google.com by smd7...@gmail.com on 18 Mar 2011 at 9:53

GoogleCodeExporter commented 9 years ago

Original comment by drdaniel...@gmail.com on 22 Mar 2011 at 12:42

GoogleCodeExporter commented 9 years ago 
I don't know why this was as invalid but it definitely is not.  I'm marking it 
as a duplicate because Issue 17 should also solve this problem as a side effect.

Original comment by smd7...@gmail.com on 23 Mar 2011 at 9:11