Carl Lowenstein wrote:
Looking at it from the puzzle point of view rather than programming,
there is one fatal flaw. A simple parity argument shows that 1/2 of
the plausible solutions can never be reached. Just swap two tiles in
the target and you can't get there from here.
Starting with '2468135 7' and trying for '12345687 '
After running for 60 seconds it has expanded to occupy 2 GB of RAM and
is still trying. I killed it.
Ayup. But that is a limitation of the puzzle, not the program.
However, I should have detected it as my system does eventually go to 0
in terms of untried solutions and gets stuck in an infinite loop. It
does quit growing, however.
It is interesting that out of all of my test cases, I never actually
managed to construct a parity-reversed problem.
I wonder why? Especially since I had pretty much a 50/50 chance every
time I created a test.
Hmmmmmm.
-a
--
[email protected]
http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
