Class notes
Part 3.1 : Problem solving - Searching ( Artificial Intelligence) : COMPUTER SCIENCE
Rating
Sold
-
Pages
17
Uploaded on
17-09-2021
Written in
2021/2022
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
Read less
Institution
Massachusetts Institute Of Technology
Whoops! We can’t load your doc right now. Try again or contact support.
Written for
Document information
- Uploaded on
- September 17, 2021
- Number of pages
- 17
- Written in
- 2021/2022
- Type
- Class notes
- Professor(s)
- Prof. agarwal, pankaj k.
- Contains
- All classes
Subjects
-
part 31 problem solving searching artificial intelligence
$15.49
Get access to the full document:
100% satisfaction guarantee
Immediately available after payment
Both online and in PDF
No strings attached
Get to know the seller
Ben002
