1 / 5

Chess

Chess. Widely studied adversarial search problem Most people are familiar with the game, yet it is still complex enough to be interesting to address Existing expertise scale that allows comparison against other human players. Complexities. En Passant Skewers Checks and mates Solution

zurina
Download Presentation

Chess

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chess • Widely studied adversarial search problem • Most people are familiar with the game, yet it is still complex enough to be interesting to address • Existing expertise scale that allows comparison against other human players

  2. Complexities • En Passant • Skewers • Checks and mates • Solution • Abstract out the moves and game functions • Rely on complex heuristics to evaluate board state

  3. UI

  4. Performance Problems • State-based search requires a lot of memory, recalculation • Solution: • Don’t store full states, only store changes • Mutator object – the Move object • A game state is the initial state plus a set of Moves applied to it • Only have to store one board, search tree of Move nodes • Can apply/undo moves relatively cheaply

  5. Search Solution • State-based greedy search. • Heuristic based on piece values. • Decent AI against absolute beginners (people learning how each piece moves) • Extremely low ELO rating

More Related