Re:Yann LeCun's comment on AlphaGo and true AI
by platz on Monday March 14, 2016 @08:08AM
(#11282317)
I wouldn't expect global maximums to even be definable for most problems
[ Parent
| on HN ]
Re:Yann LeCun's comment on AlphaGo and true AI
by emodendroket on Monday March 14, 2016 @10:34AM
(#11283087)
I think a "solution" for Go is a program that can play to a win (or a draw, I guess) in any circumstance, right? I mean, like, you can create a tic-tac-toe program that plays perfectly and will never lose, but you cannot do this for go.