Oh, yeah, you're probably right about what they were asking for there!
Well, I was wrong ^^
In that case there probably isn't any better way to do it than having the digits 0-9 as choices.
It could also be done with letters.
So an example with grouped letters like they are on a telephone keyboard. (That would be 8 options.)
So you would need the options
- ABC
- DEF
- GHI
- JKL
- MNO
- PQRS
- TUV
- WXYZ
- Confirm choice (wrong choice)
- Confirm choice (correct choice)
In the setup you use one (or two) variables and set them to 0 (or -100,000)
Each letter option adds a number to one of the variables.
These numbers would be 2^n with n = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ..., 15]
1; 2; 4; 8; 16; 32; 64; 128; 256; 512; 1024; ...; 32768
If no option is chosen twice, this gives you an almost unique number. (binary)
To allow options to be chosen two or three times without having false guesses, you could use every second number
1; 4; 16; 64; 128; 512; 2048; 8192; 32768
To allow options to be chosen up to 15 times, you could use every fourth number. (Then you have to split the set of options into two sets and use a variable for each of them.)
1; 16; 256; 4096; 32768
You would then show the respective "confirm choice" chapter depending on if the value is right or not. (With two variables, you might need more of them.)
This would force the reader to choose the correct number of each option but it doesn't need to be in the correct order. (Actually, you would need to restrict the number of choices to a certain number as well.)
To enforce a non-random order as well, you could use two sets of option chapters. (Both with the same structure as described above, though you with switched value-option pairs. E.g. level 1 uses 1=ABC and level 2 uses 256=ABC)
If the reader chooses an option, it adds the value and then redirects them either to the current choice chapter or the other choice chapter.
This way, it might still be possible to use the wrong order and maybe even the wrong options, though it should be quite unlikely.