Minecraft Username: SecretGmG
Have you read the Read Before Posting post?: yes
Your favorite thing about redstone: Using quirks in Minecraft to build specific computations way more efficiently than one might expect.
A build you have made which demonstrates redstone knowledge (This is your trial build):
A bot that plays Nim perfectly with an arbitrary number of heaps, each with a size of up to 15.
Explain what your build does in detail:
It uses the Sprague–Grundy theorem to compute the nimber-sum of the total game, which is just the XOR of all the 4-bit heap sizes. In a second pass, we can then compute, for each heap, the “desired nimber” such that the game would have nimber *0.
We do this for all heaps sequentially. The first heap for which the heap size is larger than the “desired nimber” will be selected. The appropriate number of elements will be taken from this heap such that the entire game has nimber 0. Thus, a perfect move has been played!
If a perfect move exists, this procedure will always find it.
If no perfect move exists, the bot will simply take one from the first non-empty heap.
This build is really hard to explain via text, but I will happily explain it via Discord or MC chat.
What is the name of the warp for your build on ORE?: nim
Provide your results after completing the ORE Binary Quiz: (went afk a bit)
Completed by SecretGmG in 4h32m31.004s on 10/6/2026, 14:26 UTC.
92.59% accuracy with 2/27 answers given incorrectly.
fbfdbef3-8793-433e-bb40-59330a5a626c-536563726574476d47
5a1i444x6r1i6o0y3g0q6s4w56055q524e1n266umuwi449imuwruks2
Do you agree with the rules?: yes