There's no obvious place to start with this puzzle, but there are some observations that can be made. For example:
The intuitive leap is then to realise that the grid can be filled in the following way:
In computer science terms, the grid and circles form a representation of a quadtree, which can be used to compress images by storing less information about sections of similar colour.
Filling in the grid produces:
The message reads USE BASE 64. Base64 is an encoding for converting binary data into printable ASCII characters. Of note is the fact that base64's output assigns each of the values from 0 to 63 to one of
This gives us a way to fill in the row and column of question marks, but we still need to make use of the arrows. Noting that there are 6 arrows in each row and 26 = 64, we can follow the arrows to traverse the tree and select cells in the grid. For instance, the first row means select the lower-right quadrant, then within that quadrant select the upper right quadrant, and so on.
Doing so gives 8 cells in the grid, which we can translate to pairs of letters/numbers via the base64 mapping. For example, the first row of arrows produces the letters 1i, and the second row produces 9x. Continuing in this fashion forms the message 1952PrefixCodeBy via reading down the two columns obtained.
This gives the answer as HUFFMAN, who developed the eponymous Huffman coding optimal prefix code scheme in their 1952 paper.
Initial versions of this puzzle lacked the question marks and used 0123 in place of the arrows. Once it was realised that the puzzle may be harder than initially thought, these components were changed to lessen ambiguities and to serve as additional hints.
|The answer is: huffman|