Photos  Personal  Links  Restaurants  Recipes  2020 Cruise 

Table Of Contents

Introduction:

The History of Computer Chess

Why Study Chess?

Why Is Playing Chess So Difficult?

• How Computers Play Chess
• The Basics
• Improving The Search
• Mini-max and Nega-max
• Alpha-Beta Pruning
• Aspiration Search
• Transposition Table
• Enhanced Transposition Cutoff
• Iterative Deepening
• Selective Extensions
• Quiescence Searching
• Principal Variation Search
• Memory Enhanced Test
• Killer Heuristic
• History Heuristic
• Null Move Heuristic
• The Evaluation Function 
• Other Useful Techniques
• Opening Books 
• Endgame Database 
• Deep Blue 
• How Does Deep Blue Think? 
• Deep Blue And Artificial Intelligence 

• Psychology As Intelligence 

• Chess Applications
• Green Light
 
• The Future For Computer Chess

• Program Performance and Rating