(Solved) : Artificial Intelligence Outer Loop Iterative Widening Gradually Increases Bound W Given Wm Q31130034 . . . .

Artificial Intelligence

The outer loop of iterative widening gradually increases thebound $W$ up to a given $WMax$.
The inner loop has the same skeleton as a standard graph search,with the exception that non-novel states are immediately thrownaway.
For now, implement iterative widening’s inner loop usingbreadth-first search.

Your search should return the sequence of actions required toreach a goal condition from an initial condition, along with thecost of that plan.
You also may want to print output describing how many nodes arevisited and how much time has been taken for each value of $W$.

Iterated Widening is a pruning technique that admits a lot ofdifferent search techniques:
Try