We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Recursion
  4. Simplified Chess Engine
  5. Discussions

Simplified Chess Engine

  • newvalente
     + 0 comments

    *This looks like a minimax problem but it is not! * What you might want to do is to explore the game tree until you reach m moves and say:

    1. When it's white's turn, result is YES if at least one move is winning.
    2. When it's black's turn, result is YES if all moves cannot prevent a white win if we continue