Four iterations of iterative deepening search for goal M on a binary tree Four iterations of iterative deepening search for goal M on a binary tree advertisement
Breadth-first search and uniform-cost search algorithms Breadth-first search and uniform-cost search algorithms advertisement
The separation property of graph search, illustrated on a rectangular-grid problem The separation property of graph search, illustrated on a rectangular-grid problem advertisement
A sequence of search trees generated by a graph search on the Romania problem A sequence of search trees generated by a graph search on the Romania problem advertisement
The state-space graph for the two-cell vacuum world The state-space graph for the two-cell vacuum world advertisement
Three ways to represent states and the transitions between them Three ways to represent states and the transitions between them advertisement