Exceptional clear solution for Unfair Dice by veky - python coding challenges

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

Exceptional solution in Clear category for Unfair Dice by veky

def winning_die(enemy):
    def explore(rlen, rlist, rsum, rmin):
        if rlen:
            for one in range(rmin, 1 + rsum // rlen) if rlen > 1 else [rsum]:
                explore(rlen - 1, rlist + [one], rsum - one, one)
        elif sum((p > e)-(p < e) for p in rlist for e in enemy) > 0:
            raise StopIteration(rlist)
    try:
        explore(len(enemy), [], sum(enemy), 1)
    except StopIteration as found:
        return found.args[0]
    else:
        return []

June 4, 2014

Comments:

Talim42 on June 14, 2014, 7:18 a.m.
Clear and clever

veky on June 14, 2014, 9:10 a.m.
I'm especially proud of the choice of exception: StopIteration fits perfectly here. :-)

han97 on Aug. 25, 2016, 4:55 p.m.
i did something like this, but i needed memoize to not get similar variants ( like [2,2,3] and [2,3,2]

han97 on Aug. 25, 2016, 4:56 p.m.
i did something like this, but i needed memoize to not get similar variants ( like [2,2,3] and [2,3,2]) Can you explain your solution please?

veky on Aug. 26, 2016, 6:59 p.m.
If you mean just how I avoided various permutations: that's what `rmin` is for. I generate only sorted lists, so [2,3,2] will never be generated. In order to do that, I need to memorize not only number of elements and their sum so far, but also the last element generated - so the next one starts from that. See that `for one in range(rmin, ...)`. If you mean something else... I think you got the right idea with your solution. I just wrote it much more concisely. :-)

Robert_Li on May 27, 2018, 5:02 a.m.
I probably never can so beautifully solve the problem :С

veky on May 28, 2018, 11:37 a.m.
This is not beautiful. Or at least, it's not as beautiful as it can be. :-] Same as with Open Labyrinth mission, I wrote it before CiO's Python had yield from, (ab)using exceptions as a way of floating against the current of call stack. :-) In the meantime, here is Py3.6, and I have rewritten the Open Labyrinth using `yield from`. Task for you: study it, and rewrite this one in that style. ;-)

The Game is Worth it!

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!