Download presentation
Presentation is loading. Please wait.
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
Human vs computer chess abilities 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
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?
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.