Here's an example (I guess it's DFS implementation but it has cost 5 and total nodes expanded as 20). The cost of each move is the number of tiles X moved away from previous position. And I should print the cost to reach goal state and number of nodes expanded in total. All possible successors should be generated by swapping X with tile 1 till last tile. This is to be achieved by swapping tile X with other tiles. I'm supposed to solve a puzzle containing 'N' tiles each named G and R (plus an extra tile named X which is an empty tile) such that all G tiles are positioned at the left of R tiles. New Asks: Implementing Breadth First Search to solve Puzzle
0 kommentar(er)
