csavas
21st Aug 2020
23rd Aug 2020
This is a perfectly playing Tic-tac-toe AI which uses a look-up table. Just click in the 3x3 grid with SPRK to play. After a game ended it automatically restarts in 3 seconds. Source code is available at: https://github.com/csavas03/R2_TicTacToe_AI
unbeatable
subframe
r216
game
tictactoe
r216k4a
Comments
-
i placed bobby the snowball near the machine and it totally broke the AI
-
csavas: I don't think many people are willing to dedicate a few GB of mrmory for a Connect-4 lookup table. It takes a whole heap less memory for a little bit longer time with a minimax algorithm, which is something I've done for both Connect 4 and Tic-Tac-Toe (not in TPT of course). Chess hasn't been solved but is *theoretically* solvable.
-
Solution: Launch a thermo-nuclear missile at the AI. There, you win!
-
unberatable? I don't think so *puts EMP*
-
oh nevermind , with chess it would take many place
-
@Csavas , actually not terrabytes , overly less than even a gigabyte
-
KBD2: Chess isn't a solved game yet. And Connect 4 is just as easy to "run perfectly" as this tic-tac-toe, it would just need a lot larger ROM, probably around a few terrabytes in size.
-
I like how you didn't wire up the X side
-
i put my thing left mid, it put left bottum, but whenever i do it now it just goes on the top ;-;
-
App: You can't beat it because Tic-Tac-Toe is a solved game, meaning we know *exactly* how to win or draw, but never lose. Games like Connect 4 and Chess are solved too, but they're too hard to run perfectly like this is doing.