First clear solution for The Stones by mildm - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Clear category for The Stones by mildm

def stones(pile, moves):
    m,r=sorted(moves),[0]*(pile+1)
    for n in range(1,pile+1):
        if n<=m[0]: r[n]=2
        else: r[n]=3-max(r[n-i] for i in m if n>i)
    return r[-1]

Nov. 5, 2023

Comments:

kudinov.feodor on April 2, 2024, 8:23 a.m.
I hate such solutions )))), I spent 4 hours, 5 sheets of papar, and it took me about 50 lines of code to build recoursive DFS something, and here even no recursion is involved, can you explain your solution in few words

mildm on April 2, 2024, 10:05 p.m.
It is simmetric game and winner determined by count of stones in pile. So instead of recursing from full pile you can find who win with pile of 1 stone,2,3 and so on And to be able to win you need at least one possible move which leads to pile frome which it is impossible to win for opponent.

Escher

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.