This is a tic-tac-toe implementation in Go & Raylib, as well as a minimax & alpha-beta pruning solver. The solver will always play the most optimal turn, making it impossible to beat.
At best, you can draw it:
You can check the source code here
LλBS
All systems up and running
Commit c0daef5, deployed on Oct 01, 2024.