Comment

Comment by klmadfejno

> They search through many permutation of board states and in a very dumb way merely select the decision path that leads to a winning one.

> That was never the challenge. The challenge was having them play chess; ie., no tricks, no shortcuts. Really evaluate the present board state, and actually choose a move.

Uh-huh. And how exactly do you play chess? Do you not, perhaps, think about future states resultant from your next move?

Also, Alpha Zero, with its ability to do a tree search entirely removed, achieves an ELO score of greater than 3,000 in chess, which isn't even the intended design of the algorithm.

A rock will frequently fail to get the to bottom of a hill due to local minimums vs. global minimums. A child will too sometimes.

parent klmadfejno 5 years ago

Discussion

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton