I am toying around with A* algorithms, and tried to
speed things up by using psyco for the state graph
search loop. This works great, and speeds things up by
However, when a certain starting state is chosen, or
the puzzle randomizer picks such a state, I get a
segfault. I updated to latest CVS (2002-09-09), and
still see the segfault.
Attached is my NxN-puzzle solver, with psyco enabled
and set to a starting state known to cause a segfault.
This package requires the use of PQueue, downloadable
Disable psyco (comment out line 163), or let the
program create a random puzzle (comment out lines 195
and 196), and the algorithm completes.Running out of
time right now, so I don't have a deeper analysis for
Log in to post a comment.