text: **State space search**
  State space search searches through a tree of possible states to try to find a goal state.[69] For example, 
  planning algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, 
  a process called means-ends analysis.[70] 
  
  Simple exhaustive searches[71] are rarely sufficient for most real-world problems: the search space (the 
  number of places to search) quickly grows to astronomical numbers. The result is a search that is too slow 
  or never completes.[15] "Heuristics" or "rules of thumb" can help prioritize choices that are more likely to 
  reach a goal.[72] 
  
  Adversarial search is used for game-playing programs, such as chess or Go. It searches through a tree of 
  possible moves and countermoves, looking for a winning position.[73] 