# Would a player or computer with infinite proccessing time be unbeatable? [duplicate]

Forgive me if the answer is obvious, but I wondered about this for a while. In a game where one player can calculate all possible moves (whether the amount is more or less than atoms in universe or whatever) and another does not, would the first one always win? In a game where both players can do that, would first-mover always win, or will the games always conclude in draw? To calculate, 'see', all possible game progressions from the moments the game field is set, before the game even begins, does that mean what the game is beaten? This seems like a logical conclusion, is it?

• I don't think this is exactly a duplicate, even if they are of course related. The other question asks whether a perfect algorithm exists, while this question asks what would be the outcome. Mar 26, 2018 at 17:55
– D M
Mar 26, 2018 at 18:03
• OK, I admit, the two questions you found cover this one for sure! Mar 26, 2018 at 18:24
• Unbeatable and always wins are two very different things. Mar 26, 2018 at 18:53
• "If the solution to problem X were to be found, what would that solution look like?" - I hope you see the inherent dilemma of your question. (note: SE is not the best place for speculative discussions) Mar 27, 2018 at 11:11