https://github.com/bootplug/writeups/tree/master/2019/hacklu/misc/BreaktimeRiddle
TL;DR
This problem corresponds to "[The Hardest Logic Puzzle Ever](https://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever)", just in code form. A, B, C corresponds to the three gods, and the X corresponds to whether "da" means "yes". The Wikipedia article is lengthy enough, but the gist of it is that you need to:
1. Figure out one of A, B or C that are guaranteed to **not** be random. Direct future questions to this entity.2. Ask 2 boolean questions that each reveal a new fact about the remaining values.3. With 3 unique facts, you have enough information to find the current permutation of `[0,1,2]` that corresponds to A, B and C.