As part of a homework assignment, I have to program a simple chess game in Java. I was thinking of taking the opportunity to experiment with recursion, and I was wondering if there’s an obvious candidate in chess for recursive code?
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.
As part of a homework assignment, I have to program a simple chess game in Java. I was thinking of taking the opportunity to experiment with recursion, and I was wondering if there’s an obvious candidate in chess for recursive code?
The most obvious candidate to me would be a recursive minimax routine for searching for the best moves. This also gets into a lot of the theory behind search algorithms and would be pretty cool to implement.
Example:
http://www.devshed.com/c/a/Practices/Solving-Problems-with-Recursion/6/