Neat AI does Tic Tac Toe

preview_player
Показать описание
Combining Bitwise Logic Operators with a Minimax algorithm to create an unbeatable Tic Tac Toe opponent !
Рекомендации по теме
Комментарии
Автор

It would have been really helpful if you displayed those changing bit patterns in a monospace font.

d.lawrencemiller
Автор

A strange game. The only winning move is not to play.

JamesCetrangelo
Автор

Oh, I thought you could solve this with a neat-python implementation :/ Doesn't help me with my problem but nice video nonetheless :D

thehobbyshow
Автор

Found you from a recommend and am enthralled. Hopefully this bump means big things, this stuff is entertaining and detailed!

LMitchellAnimation
Автор

It would be interesting to see this algorithm applied to connect 4 with a neural net

thegozer
Автор

Tic-tac-toe 3x3 can be simply and efficiently implementet as full List of possible situation with 4 rotation and two mirroring... It no need an AI.
On infinite board with 5 in row it actually became a task for AI

oberguga
Автор

What is the optimal draw? What does it do against itself?

smileyp
Автор

Wow, this vid has less views than I thought it'd have. Nice job on it anyways.

JoBot__
Автор

Can you apply this in a game like checkers?

derp
Автор

6:23
ok, that x placement is sub-optimal.

if you place your first move in a corner, and your opponent places theirs in the middle you want to play directly across from them

catkook