This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
I came across this 1 fantastic resource from April 2000 while looking for a way to improve the computer for my tic-tac-toe game I developed to improve my Rust skills. It uses the negamax algorithm to determine the best move at the start of each turn by trying to win the game while making it as hard as possible for the opponent if the computer can't win in the next move. Negamax is a simplification…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.