Abstract
In the game of chess the notion of beginner has three meanings. In this contribution they are used as a framework for the history of computer chess. The natural line of reasoning will then bring us to main question: Will the game of Chess (soon) be Solved? A positive answer will certainly be seen as a stepping stone for the next question: Can a computer play perfect chess? Of course, this question will have a natural follow-up in the form of an even more challenging question: Is perfect thinking by a computer possible? The audacious answer “yes” will lead to the world-wide prevailing question of all current AI scientists: Will our intelligence be replaced by AI? The article finds its way (not discussed by us) via machine learning and autonomous adaptation to deep learning and thereafter via Explainable AI and Interpretable AI to solving the Game of Chess. Cornerstones of this historical development will be given in the next three articles by Richard Pijl, Dap Hartmann and Jon Edwards.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
