Chess programs or other programs with capable heruristics for calculators

[toml_12953]

(10-16-2020 08:09 AM)pier4r Wrote:  

(10-15-2020 10:21 PM)Valentin Albillo Wrote:  Nope. Newton's method is an algorithm, not some heuristic.

I am not sure I understand. An heuristic is always an algorithm on a computer (or even on paper, if one wants to follow it). What is the difference?

Although a heuristic is an algorithm, a lot of people think of a heuristic as a proper subset of algorithms. All heuristics are algorithms but not all algorithms are heuristics. They differentiate algorithm from heuristic in that an algorithm is static; you write the solution to a problem once and it solves the problem the same way every time. A heuristic is self-modifying; it can learn by repeated trial and error so a heuristic chess program would learn by the outcome of every game and get better and better. The goal would be to have the program become unbeatable after many games, I would assume.