Coding Games and Programming Challenges to Code Better
Send your feedback or ask for help here!
Created by @nicola,validated by @5DN1L,@LittleDarkBug and @FredericLocquet.
If you have any issues, feel free to ping them.
The puzzle doesn’t define what “dominated” means.
1 Like
There are only two possible actions: C or D.
If the player made more C actions than D then C is dominating.
2 Likes
Oh, so it’s just about which of C and D are more common in the historical actions? I don’t think this is what dominated usually means. I think with the usual definition D dominates everything because your opponent can never beat you if you play D (C gives them a loss, D gives them a draw).
1 Like
Yes, it’s about the history of the actions.
1 Like
You should probably replace it by " is more common" or something like that.
Also, you should specify “strictly more”, cause testcase 5 fails with >= instead of > (but all validators work anyway).
“>=” wouldn’t make sense. That would mean C dominates D and D dominates C could both be true simultaneously. If it were to be changed my choice of wording would maybe be to use “outnumber” or “outnumbers”. But “dominates” seems pretty straight forward.
A condition like “greater/better” can mean either “striclty greater/better” or “greater/better or equivalent”.
It might be implicit for you that it’s the first one but truth is, there is no universal rule for these things that apply in all contexts/fields/languages.
So even if it seems implicit for you, I think it should always be specified.
Could someone clarify what this means “If the binary decomposition of the calculated x has an even number of 1, choose D. Else, choose C.”
Convert the decimal x value into binary number.
Count how many '1’s are in the binary number.
Even count → D,
Odd count → C.
2 Likes
I was also tripped up by the definition of “dominated”. The meaning of dominance has a clear definition in game theory, and people who’ve taken game theory courses or classes could use that instead of the frequency of choices.
Can some explain to me how this test case (5) is expecting a DRAW ?
100
3 NiceGuyBut
START C
OPP MAX D D
* C
3 FlipFlop
START RAND
ME -1 D C
ME -1 C D
To me, NiceGuyBut will always play C and ends up with 100 and FlipFlop 250.
FlipFlop will have at max same number of C and D, so OPP MAX D D should never be triggered.
As additionnal info, i also fail test case 6 expecting BirdyNiceGuy, with following results:
BirdyNiceGuy 147
TitForTat 153
I’m clueless 
EDIT: Submitting my code i also fail Validators 3 & 7 …
The score is 150 for both in BirdyNiceGuy.
Perhaps you forgot the * C line?
This puzzle wasn’t so easy ! I think the difficulty “medium” is more appropriate.
However, it is an interesting puzzle, it should has had a better ranking. I upvote !
2 Likes
What is testing in “Not so nice” i probably miss some statement but i dont see which one;
Writing a little VM to run this in Rust was really good fun. I think this may be the most actual structure I’ve had to put into a puzzle solution so far.
Thanks for the great puzzle.
Thank you for this puzzle. That doesn’t test the case “ME WIN Y”
Hi, I’m ok with all tests but not with validator 6.
Could someone give me a specific test for this validator ?
Thanks,
You can send me your code, I’ll send back what’s wrong.
I’m stuck on test & validator 6, the others are ok. I guess it has something to do with
OPP LAST N X Y: If the previous N actions of Opal are dominated by X, do Y. (You may think of LAST as MAX with a short memory.) If less than N turns have been played, consider all the turns played (excluding the current turn).
I’m wondering what consider all the turns played (excluding the current turn) means exactly. Does all the turns played implicate that I should take the turns played by the other player into account? Else I don’t see why it makes sense to mention
excluding the current turn
since that never has a value because I’m currently calculating it.