LÖVE

I'm trying to figure out how to create an unbeatable tic-tac-toe opponent with the minmax algorithm. Im having trouble deciding how to save the placements of the player and ai so that i can check win states and create the minmax trees, which leads to my next problem. How to do a minmax tree. I would really appreciate if someone could set me in the right direction and let me go from there. I'm doing this project to try and learn, releasing my badass tic-tac-toe game will come later...

Just to see if i'm even started in the right direction heres the .love

Three years ago, I wrote a Tic-Tac-Toe minimax in Python, if that helps.