The mind blowing thing is that it actually works, and with rand(0,1), it'll get you results with only 10 guesses (though it's a bit cheating haha).
Fun fact: a policy of [1,2,3,4] will solve the game.
When I started off the article, I was thinking of doing some kind of evolutionary-based policy search but turns out none of that is even necessary.
I hope to have a more technical follow up w/ deeper analysis and hopefully another one that goes into harder games where random guessing is okay, but there are more "sample efficient" methods.
Fun fact: a policy of [1,2,3,4] will solve the game.
When I started off the article, I was thinking of doing some kind of evolutionary-based policy search but turns out none of that is even necessary.
I hope to have a more technical follow up w/ deeper analysis and hopefully another one that goes into harder games where random guessing is okay, but there are more "sample efficient" methods.