%(SWI-Prolog)You can run the program by: ?- bestfs([8,1,3,7,0,2,6,5,4],P). initial([8,1,3,7,0,2,6,5,4]).
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current form. For help clari
I\'ve heard that the 8-puzzle problem can be tackled via BFS, but I don\'t understand how. I wanna know the intermediate steps that I need to get from a board like this:
加载中,请稍侯......