because the engine is only depth 18, so it wouldnt be able to show a mate in 35 or smth
Shouldn't the engine evaluation be either equal or winning at all times?
because the engine is only depth 18, so it wouldnt be able to show a mate in 35 or smth
Yeah but I'm talking about max depth which should just go on forever until the game ends.
knowing there is mate in 60 or so moves wouldn't really be helpful though if it were possible.
Yes but I want to know if it would do that.
cuz it doesn't know whether or not you might draw. For example, if you're down a pawn with a rook each... you might actually draw ![]()
knowing there is mate in 60 or so moves wouldn't really be helpful though if it were possible.
Yes but I want to know if it would do that.
Maybe cuz there might not yet be any forcing moves for mate yet, or there are multiple good moves.
cuz it doesn't know whether or not you might draw. For example, if you're down a pawn with a rook each... you might actually draw
well then it should know if its going to be a draw with best play from both sides
cuz it doesn't know whether or not you might draw. For example, if you're down a pawn with a rook each... you might actually draw
well then it should know if its going to be a draw with best play from both sides
you're lazy.
cuz it doesn't know whether or not you might draw. For example, if you're down a pawn with a rook each... you might actually draw
well then it should know if its going to be a draw with best play from both sides
you're lazy.
says you.
cuz it doesn't know whether or not you might draw. For example, if you're down a pawn with a rook each... you might actually draw
well then it should know if its going to be a draw with best play from both sides
exactly
knowing there is mate in 60 or so moves wouldn't really be helpful though if it were possible.
Yes but I want to know if it would do that.
Maybe cuz there might not yet be any forcing moves for mate yet, or there are multiple good moves.
wdym? if both sides keep on playing the best moves, it has to end in either mate or a draw.
because the engine is only depth 18, so it wouldnt be able to show a mate in 35 or smth
Yeah but I'm talking about max depth which should just go on forever until the game ends.
Even the best computers cannot calcutate all possible variations of a chess game. Therefore the computer will not be certain if a position is a clear win for one side or a draw. Only endgames with 7 or fewer pieces (including Kings) are completly solved.
because the engine is only depth 18, so it wouldnt be able to show a mate in 35 or smth
Yeah but I'm talking about max depth which should just go on forever until the game ends.
Even the best computers cannot calcutate all possible variations of a chess game. Therefore the computer will not be certain if a position is a clear win for one side or a draw. Only endgames with 7 or fewer pieces (including Kings) are completly solved.
So hypothetically, in the future, a computer would be able to calculate a full game and tell whether it's winning, losing, or a draw?
because the engine is only depth 18, so it wouldnt be able to show a mate in 35 or smth
Yeah but I'm talking about max depth which should just go on forever until the game ends.
Even the best computers cannot calcutate all possible variations of a chess game. Therefore the computer will not be certain if a position is a clear win for one side or a draw. Only endgames with 7 or fewer pieces (including Kings) are completly solved.
So hypothetically, in the future, a computer would be able to calculate a full game and tell whether it's winning, losing, or a draw?
This is currently unknow. There are more possible chess games that atoms in the universe, so it would not be possible to build a conventional computer that can solve all chess positions even with all resources in our universe. However, quantum computers might be a way around that, but is is not known right now if they acutally will.
because the engine is only depth 18, so it wouldnt be able to show a mate in 35 or smth
Yeah but I'm talking about max depth which should just go on forever until the game ends.
Even the best computers cannot calcutate all possible variations of a chess game. Therefore the computer will not be certain if a position is a clear win for one side or a draw. Only endgames with 7 or fewer pieces (including Kings) are completly solved.
So hypothetically, in the future, a computer would be able to calculate a full game and tell whether it's winning, losing, or a draw?
This is currently unknow. There are more possible chess games that atoms in the universe, so it would not be possible to build a conventional computer that can solve all chess positions even with all resources in our universe. However, quantum computers might be a way around that, but is is not known right now if they acutally will.
very scientific, but also, if you are down a rook, and both players play the best moves, you are still losing
So, lets take the starting position. If both sides play the absolute best moves, it would be a draw. That would mean the engine should show a equal evaluation. Now, let's say one side is up a rook. If both sides play the best moves, the side with the rook should win. That means it should be Mate in X amount of moves. Why is it not like this?