From the hub, tagged: "select"

Graph Traversal for Problem Solving

This post is external to PrologHub

An example of using depth first and breadth first searches (written to be nearly identical to highlight the subtle difference between a stack and a queue) to solve three common puzzles commonly used as examples in AI textbooks.