HOW TO PLAY
1. The sequences: the game will generate random 2-digits hexadecimal values and arrange them into sequences. There will be 3 sequences:
Sequence 1: 2 hexadecimals.
Sequence 2: 2 to 3 hexadecimals.
Sequence 3: 3 to 4 hexadecimals.
The matrix: from those 3 sequences, a matrix that comprise the hexadecimals that the sequences contain will be generated. The size of the matrix will be determined by summing the number of hexadecimals contained in sequence1 and sequence2.
The buffer: the buffer will be created, the number of slots in the buffer is equal to the total of hexadecimals initially created plus two.
You will have to select a hexadecimal in the matrix that matches the hexadecimal in one (or many) sequence. You can only choose one hexadecimal at a time.
On your first move, you will only be allowed to choose the hexadecimals on the first row.
Each time a correct hexadecimal is selected, the corresponding hexadecimal in the sequences will change color to indicate correct choice. Additionally, the selected hexadecimal will be disabled for the rest of the game. For example, I chose CD.
After the first move, you will be allowed to choose the hexadecimals in the column below the first. All other unrelated hexadecimals will be temporary disabled so that you can’t click on them.
Then on the second move, when you click on a hexadecimal, the same thing happens just like on the first move. But there’s a catch! This time you will only be allowed to choose the hexadecimals on the same column as the hexadecimal you previously chose. For example, I chose 62.
Remember to also check on the buffer limit, you are only permitted to choose up to the buffer limit. In this case, you can choose 7 hexadecimals before the game ends. By this time, we have finished sequence 1!
And the cycle continues. Summarize: on the first move, you can choose horizontally, to the next, you can choose vertically, then horizontally again,...
Keep repeating until you complete one (or many) sequences. Unfortunately I can only complete sequence 1.
