Quote:
Originally Posted by Dieter
„There are no unwinnable sets for n smaller than 9“. An example:
n=8, k=4=number of spins. When the player chooses a number q and makes 4 spins, he gets a combination of 4 different numbers between 1 and 8. When he chooses another q, he gets perhaps another combination  or the same combination.
There are (8 choose 4) = 70 such combinations. All are reachable, if you ckeck enough values for q.
But:
Example n=9 und k=4. There are 126 possible quintetts of values. But this time, only 123 of these values are reachable  (1,2,5,8,9) and (2,3,4,5,8) and (2,5,6,7,8) are not reachable. Just for fun I checked 1<=q<=10000000  no chance .
These three combinations are "unwinnable sets".

Frankly, it is you dieter who should write the challenge, I understand perfectly the example 2, and I found all the combinaisons :
"70 combinations for the 8".
"126 possible quintetts of values"
(1,2,5,8,9) (2,3,4,5,8) (2,5,6,7,8). Not reachable.
Now i am in the process of resolving the question. !
..
Thanks.