3 ms·
Perfect information isn't true, you don't exactly know the opponents next move. This broadens the search tree exponentially. Generally, with many hard problems,
by throwupper247 11y ago
Perfect information isn't true, you don't exactly know the opponents next move. This broadens the search tree exponentially. Generally, with many hard problems, the size of the problem is a problem, when memory is limited.