1 / 8

Computer Chess

Computer Chess. Humble beginnings. The Turk Ajeeb Mephisto El Ajedrecista. Brute force vs selective search. Advantages of selective search The possibility of not wasting calculations The Horizon Problem Disadvantages of selective search Takes time itself to select

cherie
Download Presentation

Computer 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. Computer Chess

  2. Humble beginnings • The Turk • Ajeeb • Mephisto • El Ajedrecista

  3. Brute force vs selective search • Advantages of selective search • The possibility of not wasting calculations • The Horizon Problem • Disadvantages of selective search • Takes time itself to select • Difficult to select well • Advancement of computer technology

  4. Humans 40-50 positions Masters use pattern matching Can make mistakes Anti-computer tactics Computers With dedicated hardware, many billions of positions Does not make mistakes Strong against aggressive play Human vs computer chess abilities

  5. Human-computer chess matches • 1997 Kasparov vs Deep Blue • Kramnik vs Deep Fritz matches

  6. Endgame tablebases • Endgames traditionally been a weakness for computers • Stored endgame solutions, solved by computers • 50-move rule

  7. Implementation issues • Board representation • Search techniques • Leaf evaluation

  8. Questions?

More Related