For example, I am implementing AI for turn based game and have enough computational resources for build full game tree. My problem is the game can be infinite if both players will repeat moves and my minimax implementation stucks because game tree is infinite respectively.

For example, my game is in state S1, player 1 do action A1, player 2 do action A2 and we are again in state S1. I can't evaluate S1 node because I need to evaluate all subnodes.

I have no idea how to handle this.

  • $\begingroup$ Did you find a solution? I'm trying to do the exact same thing. $\endgroup$
    – Umomps
    Oct 17, 2021 at 16:26


You must log in to answer this question.

Browse other questions tagged .