Hi Everyone!
Nice to see there is an active community here, that offers support to beginners.
I have the following problem I am trying to resolve with a roulette wheel program:
Input:
#First array that contains all the roulette wheel numbers in clockwise order starting from pocket 0:
ckwheel = np.array([ 0, 32, 15, 19, 4, 21, 2, 25, 17, 34, 6, 27, 13, 36, 11, 30, 8, 23, 10, 5, 24, 16, 33, 1, 20, 14, 31, 9, 22, 18, 29, 7, 28, 12, 35, 3, 26 ])
There is a second array (let’s call it arr2) that contains 4 numbers (random values from the ckwheel array)
Output needed:
I need to identify:
1. Are all the 4 numbers in arr2 within a distance/range of 17(consecutive)pockets on a roulette wheel?
For example:
example 1:
arr2=[4, 17, 27, 23]
These numbers are from index 4 to index 17 in the ckwheel array and are actually in a distance of 13 in the pockets in a roulette wheel. So they are also in a range of 17 consecutive pockets.
example 2:
arr2=[ 28, 3, 19, 27]
These numbers are on index 32, 35, 3 and 11. The roulette wheel being continuous (not like my array), these 4 numbers are in fact in a range of exactly 17 pockets.
So first, print a message :
“the numbers in arr2 can be covered within 17 consecutive pockets”
or
" No, the numbers are too distanced to cover"
2. If the numbers can be covered by a 17 pockets range, identify and print the middle(center) pocket number of this 17 numbers range
I hope I was clear enough to get some ideas for coding this.
Thank you!