Class notes
Part 3.1 : Problem solving - Searching ( Artificial Intelligence) : COMPUTER SCIENCE
- Institution
- Massachusetts Institute Of Technology
Some issues: Search trees grow very quickly The size of the search tree is governed by the branching factor Even this simple game tic-tac-toe has a complete search tree of 984,410 potential nodes The search tree for chess has a branching factor of about
[Show more]