Current chess algorithms go about 1 or maybe 2 levels down a tree of possible paths depending on the player's move's and the opponent's moves. Let's say that we have the computing power to develop an algorithm that predicts all possible movements of the opponent in a chess game. An algorithm that has all the possible paths that opponent can take at any given moment depending on the players moves. Can there ever be a perfect chess algorithm that will never lose? Or maybe an algorithm that will always win?I mean in theory someone who can predict all the possible moves must be able to find a way to defeat each and every one of them or simply choose a different path if a certain one will effeminately lead him to defeat.....edit--What my question really is. Let's say we have the computing power for a perfect algorithm that can play optimally. What happens when the opponent plays with the same optimal algorithm? That also will apply in all 2 player games with finite number (very large or not) of moves. Can there ever be an optimal algorithm that always wins?Personal definition: An optimal algorithm is a perfect algorithm that always wins... (not one that never loses, but one that always wins
Can there be a perfect chess algorithm?
algorithms;turing machines
Your question is akin to the old chestnut: What happens when an irresistible force meets an immovable object?  The problem is in the question itself: the two entities as described cannot exist in the same logically consistent universe.  Your optimal algorithm, an algorithm that always wins, cannot be played by both sides in a game where one side must win and the other must by definition lose.  Thus your optimal algorithm as defined cannot exist.