Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Store 'em all! solution in Clear category for The Stones by obone
def stones(pile, moves):
results = [False] * min(moves)
for p in range(min(moves), pile + 1):
results.append(min([not results[max(0, p - m)] for m in moves]))
return results[-1] + 1
Aug. 9, 2019
