Post 9fUwWRp3aD4S5f1m1Q by equal@mastodon.technology
(DIR) More posts by equal@mastodon.technology
(DIR) Post #9fUvGO4deXgvsP5sLg by equal@mastodon.technology
2019-02-04T17:08:41Z
0 likes, 0 repeats
was trying to mess around with the game of Nim last night. i must be having an extreme brain fart because i don't get it. at all. in the slightest. which is weird because i'm pretty good at chess and that's way more complicated.
(DIR) Post #9fUvGOMiZK9YmTYJWq by trickster@mastodon.technology
2019-02-04T17:11:36Z
0 likes, 0 repeats
@equal what part are you stuck with?
(DIR) Post #9fUvbmxQKbOt8IvLpw by equal@mastodon.technology
2019-02-04T17:15:28Z
0 likes, 0 repeats
@trickster there's a variation of it called Nimble on www.hackerrank.com - and the explanation makes no sense. it gives an example saying players make optimal moves but doesn't say what IS an optimal move. the description is vague.
(DIR) Post #9fUvrEgBXmq1SGE6yG by trickster@mastodon.technology
2019-02-04T17:18:16Z
0 likes, 0 repeats
@equal don't know the variation, but I'm guessing you know how optimal moves work in nim, right?
(DIR) Post #9fUw2gGXJqBuCJgeZ6 by equal@mastodon.technology
2019-02-04T17:20:20Z
0 likes, 0 repeats
@trickster sorta. never really seen a game like this before. mostly just frustrated with whatever mental block is preventing me from understanding something so obviously basic. i'll figure it out.
(DIR) Post #9fUwJoT055BOYVgbR2 by equal@mastodon.technology
2019-02-04T17:21:01Z
0 likes, 0 repeats
@trickster as i was saying, chess, way more complex, way more end-states, and i'm good at that... so... yeah.
(DIR) Post #9fUwJocZVUq52CAFM0 by equal@mastodon.technology
2019-02-04T17:22:31Z
0 likes, 0 repeats
@trickster tell you what though, you seem keen to help, so tell me if this description is vague to you.
(DIR) Post #9fUwJokN2V4rQNoTVg by trickster@mastodon.technology
2019-02-04T17:23:25Z
0 likes, 0 repeats
@equal pretty clear to me, but then again I had a class on game theory :))
(DIR) Post #9fUwTjhodZSKgYLcPY by trickster@mastodon.technology
2019-02-04T17:25:13Z
0 likes, 0 repeats
@equal don't knock yourself too hardNim is a pre-arranged game. knowing how many stones there are, and what is the maximum amount of stones I can take in a move, I will know from the start if I'm gonna win or loseNim variations are like that but with extra stepsit's ususally more easy to work your way back from the end state to the start of the game than the other way round. they to solve a simpler version of this (with less squares and stones) like that first
(DIR) Post #9fUwWRp3aD4S5f1m1Q by equal@mastodon.technology
2019-02-04T17:25:42Z
0 likes, 0 repeats
@trickster ugh, i didn't. the bit i find confusing is that in an example, in the game stage shown in the yellow graphic, it says the optimal first move is to move one coin from cell 2 to cell 0. it's just the Why of that is not obivous
(DIR) Post #9fUwYnOsKQsXajtvU0 by equal@mastodon.technology
2019-02-04T17:26:05Z
0 likes, 0 repeats
@trickster cool, good call, thanks
(DIR) Post #9fUwi8i2THEuHqJuEq by trickster@mastodon.technology
2019-02-04T17:27:49Z
0 likes, 0 repeats
@equal I think that quip is more to be used as a check that you got it, rather than it being a good explanationnevertheless, if you need a class on game theory, then the explanation is pretty crap, I'll give you that
(DIR) Post #9fUwundE9Gp8gF6eDw by equal@mastodon.technology
2019-02-04T17:30:06Z
0 likes, 0 repeats
@trickster cheers. the working backwards from end-states idea is good, will go with that. at this point i'll head off and stop muttering about being good at playing chess and writing compilers.