I’m trying to write a chess game and find that I cannot find solutions to find a stalemate situation. I’m trying to google, but can’t find anything. Is there a well-known algorithm or something?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’m trying to write a chess game and find that I cannot find solutions to find a stalemate situation. I’m trying to google, but can’t find anything. Is there a well-known algorithm or something?
Your move generator will be one of two different designs;
The former is better as it doesn’t need post-processing.
A stalemate condition is simply one where there are no legal moves and the moving-side’s king is not in check. A checkmate condition is one where there are no legal moves but the moving-side’s king is in check.
In other words if you’ve figured out how to detect check and checkmate, you’ve already got everything necessary to detect stalemate.