I would not agree here with Ronald.syzygy wrote:Define brute force...Leto wrote:Correct me if I'm wrong but most chess programs don't use brute force, even Deep Blue wasn't brute force. Selective search techniques have been used for many decades.
Deep Blue was full width plus selective extensions. If we equate brute force with Shannon's Type A Strategy, then Deep Blue was brute force.
Of course Deep Blue did use a transposition table, so it too would have solved the test position in a fraction of a second.
Even modern chess engines are mostly intended to be brute force in the sense that they (eventually) enumerate all possible solution candidates. They are just a lot better at looking at more promising lines earlier than the engines of the past.
for me, a brute-force searcher implies a branching factor bigger than 10, at least.
as far as I know, modern top engines exhibit much lower BFs.
in that sense, I guess they are more wise than brute-force.
In any case, any sophistication of the code, adding more lines, would generally suppose an engine that is less of a brute-searcher, and modern top engines seem in general to add more sophistication in their codes than otherwise.