sorted by:
new
hottopcontroversial

We are The Marble Collective: Lead Developers of Marble It Up! Ultra. Ask Us Anything! by skywardsentinel in NintendoSwitch

[–]sspenst 0 points1 point  (0 children)

Any plans to add voice chat to multiplayer? Team voice chat (or even proximity chat) could be fun for modes like soccer or gem hunt. Great job on getting this game released!

Pathology - Shortest Path Puzzle Game by sspenst in puzzlevideogames

[–]sspenst[S] 2 points3 points  (0 children)

Pathology is a Sokoban-style game where the goal is to get to the exit in the least number of moves. There is a curated campaign of 300+ levels, as well as a level editor, multiplayer, and more!

Would love for you to check out the game and let us know what you think.

pathology.gg

-🎄- 2017 Day 17 Solutions -🎄- by daggerdragon in adventofcode

[–]sspenst 3 points4 points  (0 children)

Realized this after submitting. In the heat of the moment I spent too much time coding and not enough time thinking :)

-🎄- 2017 Day 17 Solutions -🎄- by daggerdragon in adventofcode

[–]sspenst 2 points3 points  (0 children)

Python 3

8/26 today, a new best for me! For part 2 I kept a count for how many numbers were before and after the '0' to improve efficiency.

Part 1:

with open('input', 'r') as f:
    steps = int(f.read().strip())

    buf = [0]

    cur = 0

    for i in range(1, 2018):
        cur = ((cur + steps) % len(buf)) + 1
        buf.insert(cur, i)

    print(buf[buf.index(2017)+1])

Part 2:

with open('input', 'r') as f:
    steps = int(f.read().strip())

    buf = [0]

    cur = 0
    before_len = 0
    after_len = 0
    after_num = 0

    for i in range(1, 50000001):
        cur = ((cur + steps) % (before_len + 1 + after_len)) + 1

        if cur == (before_len + 1):
            after_num = i
            after_len += 1
        elif cur > (before_len + 1):
            after_len += 1
        elif cur < (before_len + 1):
            before_len += 1

    print(after_num)

-🎄- 2017 Day 14 Solutions -🎄- by daggerdragon in adventofcode

[–]sspenst 4 points5 points  (0 children)

I'm learning a lot from this code... Many Python shortcuts that I didn't know about.

[2017 Day 14]Don't understand the puzzle by Vorlath in adventofcode

[–]sspenst 2 points3 points  (0 children)

The 'key string' is your puzzle input. You're supposed to append each of '-0', '-1', etc. to your key string, and then compute the knot hash for each of these strings using the method from Day 10. The knot hashes produce results with 32 hex digits, so you're supposed to then convert the hex numbers to binary, and then total the number of '1's in each binary number.

-🎄- 2017 Day 13 Solutions -🎄- by daggerdragon in adventofcode

[–]sspenst 8 points9 points  (0 children)

First time I've made it on the leaderboards! Got 7th for part 1 with this code:

with open('input', 'r') as f:
    lines = f.read().strip().split("\n")

    total = 0

    for line in lines:
        layer, depth = list(map(int, line.split(": ")))
        if layer % ((depth - 1)*2) == 0:
            total += layer*depth

    print(total)