alt Hacker NewsWhat about Minimax algorithm playing Tic-Tac-Toe? Is it inteligent? Is it inteligent we if we reduce the search depth so the right decision is not obvious?
What about Minimax algorithm playing Tic-Tac-Toe? Is it inteligent? Is it inteligent we if we reduce the search depth so the right decision is not obvious?
A tic-tac-toe minimax algorithm makes choices but with exhaustive search so it really doesn't have to form a judgement about an unresolved situation or decide what is likely to work. Not much of a decision if you're not exercising any judgememt.
Exhaustive search is impossible in chess, so again, chess engines do something different. A chess engine has to stop well before terminal positions and make judgements about positions it cannot fully resolve.
Reducing the search depth would make it more interesting because it too has to evaluate unresolved positions. But then the interesting part becomes the evaluation function is. For tic tac toe, it's going to be very easy to be written in such a manner where most of the judgement is supplied by the designer and not the system.