IDS should produce solution with length/depth equal to BFS/A*1

digimokan / cpp-sliding-eight-puzzle

Sliding Eight-Puzzle solver

0 stars 0 forks source link

IDS should produce solution with length/depth equal to BFS/A*1 #5

Open digimokan opened 5 years ago

digimokan commented 5 years ago

Description

When running the program with ./eight-puzzle -b "567408321" "123804765" (a 15-step solution), BFS and A*1 each produce a solution with depth 31 and cost 128. However, IDS produces a solution with depth 33 and cost 144. IDS solution should have the same depth and cost.

Source Files

SolverIDS.cpp maybe SolverBase.cpp?