[2015-11-04] Challenge #239 [Intermediate] A Zero-Sum Game of Threes : dailyprogrammer
Let's pursue Monday's Game of Threes further!
To make it more fun (and make it a 1-player instead of a 0-player game), let's change the rules a bit: You can now add any of [-2, -1, 1, 2] to reach a multiple of 3. This gives you two options at each step, instead of the original single option.
With this modified rule, find a Threes sequence to get to 1, with this extra condition: The sum of all the numbers that were added must equal 0. If there is no possible correct solution, print Impossible.
Read full article from [2015-11-04] Challenge #239 [Intermediate] A Zero-Sum Game of Threes : dailyprogrammer
No comments:
Post a Comment