... than 1 and b, the game can be played with a set of numbers between any 2 points with the same strategy; for example: Players may choose any number between 3 and 7, and the player who makes the running total 43 wins. Let m = 43, a= 3 and b= 7 S = 43 - ((3+7).INT[m/(a+b)]) S = 43 - (10*INT[43/10]) S = 3 We play first, and begin on 3. After our opponent plays we make our turn bring the running total to the next of our target points (in steps of 10); 3, 13, 23, 33, 43. Our strategy could also be used in a game with a uniform limited use of all the numbers a to b (assuming you can still reach you target number without running out of numbers); as effectively you pair the numbers up, and your opponent would run out of the opposite of the pair at the same time ...

See this essay or coursework document in full right now