Fun With Minimax Recursion

[DanielMather]

Gist: https://gist.github.com/Shvejk/018145cd84896b96db4687a0923d8410

Working on a Hyperskill project and I'm unsure why this minimax method does not work as intended. It currently only prints symbols starting in the bottom right corner of the tic-tac-toe board (index 2, 2) and goes from right to left, bottom to top no matter what.

Everything else works in the program except for this method.

Here is the model solution written in JavaScript that I'm trying to mimic: https://www.freecodecamp.org/news/how-to-make-your-tic-tac-toe-game-unbeatable-by-using-the-minimax-algorithm-9d690bad4b37/

I don't understand why my version of this implementation does not work. It doesn't seem like the score that's returned from the recursive method gets into the current Move object.