@makehacklearn Yeah, it’s brute forcing the static evaluator. You can’t brute force the game tree (which is how chess was solved).
-
-
Replying to @Meaningness
@makehacklearn I find it unsurprising & uninteresting that you can brute force the static evaluator; hard to imagine how that could not-work2 replies 0 retweets 0 likes -
Replying to @Meaningness
@Meaningness@makehacklearn What do you mean by brute-forcing the static evaluator? Seems like a contradiction in terms to me.1 reply 0 retweets 0 likes -
Replying to @dfko_0
@dfko_0@makehacklearn Play zillions of games, see what board configurations lead to wins, record that3 replies 0 retweets 0 likes -
Replying to @Meaningness
@Meaningness@makehacklearn Well, store that in a lookup table, I'd agree brute force, but compress it somehow,deep net or whatever=learning1 reply 0 retweets 0 likes -
Replying to @dfko_0
@dfko_0@makehacklearn Yeah, the question is whether the compression is doing something clever/interesting.1 reply 0 retweets 0 likes
@dfko_0 @makehacklearn My bet is not, but it would take work to be sure. I’ve done that in other NN cases, and the answer is usually “no.”
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.