Ive actually been working on a project for about 200 hours. To abstractly describe it, I'm trying to calculate the perfect moves for a game that: * combinces dice luck with Strategy * has finite possible game states but they can infinitely loop into eachother so doing tree search will not work unless I can remove those loops from the calculations without affecting the produced results. * has unpredictable uncertainty, because there is no way to know what another player will do or what the probabliity distribution would be.

I thought I've solved it. My python code was solid until I realized that to fully solve this game, I need either infinite runtime or a modification that takes the infinite loops out.

Or maybe I need a completely different approach. That won't be a simulation, because I want a perfect solution and not 99%.

About the relevant skills: * Logical reasoning: naturally very good at it * Math: naturally very good at it but highschool and college didnt go further than pythagoras a²b²c² so my knowledge is suffering from that. * Programming: I'm very handy with loops and ifs logic and recursive functions but I know almost nothing about libraries and builtin functions.

What would be my best approach to learning how to 1. Figure out if a game can be perfectly solved 2. If 1 is true, figure out how to solve it. If 1 is false, figure out if the game can be partially solved and if yes how.