An and–or tree is a graphical representation of the reduction of problems (or goals) to conjunctions and disjunctions of subproblems (or subgoals).
These include searching the tree depth-first, breadth-first, or best-first using some measure of desirability of solutions.
In the case of logic programs containing variables, the solutions of conjoint sub-problems must be compatible.
Subject to this complication, sequential and parallel search strategies for and–or trees provide a computational model for executing logic programs.
The mapping is possible, when the search is done with only a binary goal, which usually is "player to move wins the game".