search

frostburn / speedcube

Bitboard implementation of the 3x3x3 twisty puzzle in C
MIT License
0 stars 0 forks source link

Explore randomly in IDA* #25

Open frostburn opened 1 year ago

frostburn commented 1 year ago

Priority order is nice and deterministic but presumably very loopy. Random exploration order could be faster on average.

frostburn commented 1 year ago

Random exploration seems to be slower. Need to try uncorrelated, but deterministic exploration so that ID descends into the same branches on every iteration.