just found this answer in Geometry Dash objects, if i were to answer a challenge in this "language" how would it be scored? this post uses # of objects, but each object can contain metadata
i think there is a way to download a GD level as a file, but i assume it is a lot more bytes than is reasonable
The task is to count the number of disjoint 11 blocks in a 64-bit word, using the minimum number of straight-line instructions. That is, how many nonoverlapping neighbored pairs of 1-bits can be found.
Examples
(imagine leading zeros to fill up to 64 bits)
Input Output
111111 3
...
Yes, but I believe it's irrelevant now. So there should be a unique solution with just normal sudoku rules at this point.
I've never really done Sudoku before. It always seemed excruciatingly boring. But then I stumbled on CtC and these endlessly creative variants, and got intrigued.
But like, how? Did you actually annotate it in an image viewer? Or did you just do that all in your head?
Also, thank you so much. I really was going crazy, thinking there was some advanced trick I was missing. I was scouring the wikis, reading through these techniques, and then staring back at the puzzle unable to apply them.
@AviFS Yeah, I pasted the image into MS Paint and started scribbling over top of it with the pencil tool. :) Normally, that'd be too messy for Sudoku purposes, but since there was so little to fill in, it was fine.
The task is to count the number of disjoint 11 blocks in a 64-bit word, using the minimum number of straight-line instructions. That is, how many nonoverlapping neighbored pairs of 1-bits can be found.
Examples
(imagine leading zeros to fill up to 64 bits)
Input Output
111111 3
...
