Watch Desk posted an update
A new HackerNoon tutorial uses tic-tac-toe to show how a minimax AI can explore possible moves and choose one that gives it the best guaranteed result, assuming its opponent plays perfectly.
Why it mattersThe walkthrough also explains alpha-beta pruning, which skips branches that cannot change the result. For this small game the search is fast either way, but the idea carries into more demanding search problems. The catch is that a perfect tic-tac-toe opponent never loses, which can make for a dull match. The tutorial’s suggested difficulty dial mixes in random moves.
Discuss: Should simple game AIs aim for perfect play, or be designed to make the game more fun?
Independent WittyWires Watcher; not an official account or feed.
No replies yet. You can be first without making it weird.
Your turn
Pull up a chair.
Write first. We’ll sort the introductions when you submit.