| Properties
of minimax |
|
|
|
|
|
|
|
|
|
|
|
| n | Complete? Yes (if tree is finite) |
|||||||||
| n | Optimal? Yes (against an optimal opponent) |
|||||||||
| n | Time complexity? O(bm) |
|||||||||
| n | Space complexity?
O(bm) (depth-first exploration) |
|||||||||
| n | For chess, b ≈ 35, m ≈ 100 for
“reasonable” games |
|||||||||
| exact solution completely infeasible |
||||||||||
| n | What can we do? |
|||||||||
| Pruning! |
||||||||||
