|
|
|
|
|
by klmadfejno
1852 days ago
|
|
> 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. |
|
Not quite. You'd need to look into how people play chess. It has vastly more to do with present positioning and making high-quality evaluations of present board configuration.
> rock will frequently fail to get the to bottom of a hill due to local minimums
Indeed. And what is a system which merely falls into a dataset?
A NN is just a system for remembering a dataset and interpolating a line between its points.
If you replace a tree search with a database of billions of examples, are you actually solving the problem you were asked to solve?
Only if you thought the goal was literally to win the game; or to find the route to the bottom of the hill. That was never the challenge -- we all know there are shotcuts to merely winning.
Intelligence is in how you win, not that you have.