News for hackers. Stuff that matters.
Re:Richard Feynman Computer Heuristics Lecture (1985) [video] by tosh on Monday November 26, 2018 @07:47AM (#18532928)
I like how he describes chess about 44 minutes in. Makes me wonder how modern chess engines like stockfish rate a certain board configuration. I expect it is quite more nuanced than his description of dead/not dead and summing up the material on both sides.
Re:Richard Feynman Computer Heuristics Lecture (1985) [video] by jointpdf on Monday November 26, 2018 @10:43AM (#18534067)
There is a fascinating (and charming) paper by Alan Turing that describes his "Turochamp" chess 'engine'. Apparently, it was the first program capable of playing a complete game of chess, and the first program that could be described as a computer game (although it sadly only ever existed on paper). The general pattern he outlines (a heuristic evaluation function with hand-tuned weights, along with minimax game tree search--i.e. backwards induction) has formed the basis of most chess engines, both ancient and modern. Here's the original copy: https://docs.google.com/file/d/0B0xb4crOvCgTNmEtRXFBQUIxQWs/...

Intriguingly, Turing posed the question, "Could one make a machine to play chess, and to improve its play, game by game, profiting from its experience?" This reinforcement learning approach to chess did not enjoy much success--until AlphaZero. That story that has been well-told in many places, but perhaps best so by David Silver in this recently released lecture by DeepMind: https://www.youtube.com/watch?v=ld28AU7DDB4. The first ~40 mins are a lucid explanation of the classical methods, and the rest covers RL/MCTS/AlphaZero.

Re:Richard Feynman Computer Heuristics Lecture (1985) [video] by opo on Monday November 26, 2018 @05:06PM (#18537257)
>..."Could one make a machine to play chess, and to improve its play, game by game, profiting from its experience?" This reinforcement learning approach to chess did not enjoy much success--until AlphaZero.

Don't forget Samuel's computer checkers program from 1959. It was among the world's first successful self-learning programs.

https://en.wikipedia.org/wiki/Arthur_Samuel

Re:Richard Feynman Computer Heuristics Lecture (1985) [video] by thanosnose on Monday November 26, 2018 @08:39AM (#18533225)
> I expect it is quite more nuanced than his description of dead/not dead and summing up the material on both sides.

It is a bit more nuanced. There are heuristics ( breadth and depth searches ) which assigns positional values and also opening and end game database searches. Using remaining material values is the most basic form of chess engine. If that's all stockfish did, most chess players would beat stockfish.

I built a very simple chess engine for my AI class. I started off with the basic "material values". Then added basic heuristics. Then added database lookups.

Now with neural networks and machine learning, chess engines are even more sophisticated.