Old out dated algorithms use this strategy:

1. A problem graph, containing the start node S and the goal node G.

1. A strategy, describing the manner in which the graph will be traversed to get to G.

1. A fringe, which is a data structure used to store all the possible states (nodes) that you can go from the current states.

1. A tree, that results while traversing to the goal node.

1. A solution plan, which the sequence of nodes from S to G.

To MAGA this strategy is like finding stone age drawings in a cave.

>>19300518

>>19300518

Q taught us to use his fact finding style and continue with out his help.