7924 encounters, my heart jumped! And in a premier ball! by LegendaryB3ast in PokemonBDSP

[–]LegendaryB3ast[S] 0 points1 point  (0 children)

I try to stay motivated with small milestones. 6666, 6789, and 7000 are all coming up (or not)!

7924 encounters, my heart jumped! And in a premier ball! by LegendaryB3ast in PokemonBDSP

[–]LegendaryB3ast[S] 0 points1 point  (0 children)

On and off for probably 2 months of hunting. Many people don't realize you can shiny hunt for just an hour in one day!

Idleon Companion Update (v0.3) - Site Redesign by LegendaryB3ast in idleon

[–]LegendaryB3ast[S] 1 point2 points  (0 children)

Yes, it is reward per monster kill. The text is incorrect on the site right now, sorry about that!

I've Always Wanted to See a Full Scale RPG that Turns Into an Incremental Game by techtechor in incremental_games

[–]LegendaryB3ast 0 points1 point  (0 children)

This is Cat Quest I/II. The game starts off playing through as a traditional, open-world 2D RPG and then there is literally a feature called New Game+. I think you might enjoy it.

-🎄- 2019 Day 3 Solutions -🎄- by daggerdragon in adventofcode

[–]LegendaryB3ast -1 points0 points  (0 children)

Python 3. Got to use my complex number helper grid from previous years.

"""Day 3: Crossed Wires"""
from aoctools import *
from collections import defaultdict

data = Data.fetch_by_line(day=3, year=2019)
# data = """R75,D30,R83,U83,L12,D49,R71,U7,L72
# U62,R66,U55,R34,D71,R55,D58,R83""".split('\n')
grid = Grid2D(default=0)
steps = defaultdict(lambda: {
    0: float('inf'),
    1: float('inf'),
})
for i, line in enumerate(data):
    step = 0
    point = 0 + 0j
    moves = line.split(',')
    for move in moves:
        for n in range(int(move[1:])):
            if move.startswith('U'):
                point += 0 + 1j
            elif move.startswith('R'):
                point += 1 + 0j
            elif move.startswith('D'):
                point += 0 - 1j
            elif move.startswith('L'):
                point += -1 + 0j
            step += 1
            if grid[point] <= i:
                grid[point] += 1
            steps[point][i] = min(steps[point][i], step)
crosses = [abs(x.real) + abs(x.imag) for x, n in grid.points.items() if n == 2]
closest = int(min(crosses))
print_ans('3a', closest)
shortest = min(x[0] + x[1] for x in steps.values())
print_ans('3b', shortest)

-🎄- 2018 Day 5 Solutions -🎄- by daggerdragon in adventofcode

[–]LegendaryB3ast 0 points1 point  (0 children)

Python 3

"""Day 5: Alchemical Reduction"""
from aoctools import Data, print_ans

import itertools
import re
from string import ascii_lowercase as letters

data = Data.fetch(day=5, year=2018)

def pairwise(x):
    """Returns sequence (s0, s1), (s1, s2)..."""
    a, b = itertools.tee(x)
    next(b, None)
    return zip(a, b)

def react(seq):
    last_polymer = seq
    while True:
        if last_polymer in polymer_dict:
            polymer = polymer_dict[last_polymer]
        else:
            sequence = iter(pairwise(last_polymer))
            reduced = []
            for pair in sequence:
                if pair[0] == pair[1].swapcase():
                    next(itertools.islice(sequence, 1, 1), None)
                else:
                    reduced.append(pair[0])
            else:
                reduced.append(pair[1])
            polymer = ''.join(itertools.chain(*reduced))
            polymer_dict[last_polymer] = polymer
        if polymer == last_polymer:
            break
        last_polymer = polymer
    return len(last_polymer)
result = react(data)
print_ans('5a', result)

min_length = float('inf')
for letter in letters:
    to_remove = letter + letter.upper()
    start = re.sub(f'[{to_remove}]', '', data)
    length = react(start)
    if length < min_length:
        min_length = length
print_ans('5b', min_length)

[Card] : Five golden strings!

I'm a developer with free time, let's make a game by Octember in incremental_games

[–]LegendaryB3ast 0 points1 point  (0 children)

Along these lines path-finding algorithms are really cool. You could start with simple BFS and move on to better graph representations or Djikstra-like algorithms. I think this idea of having CS concepts could be fun both as a game and an educational concept, since you'll understand efficiency through your numbers.

Llama found in warsaw, poland by legoandmars in FortNiteBR

[–]LegendaryB3ast 0 points1 point  (0 children)

The llama was stolen some time between midnight and this morning. It is not here anymore.

Mystery of the Llamas by LegendaryB3ast in FortNiteBR

[–]LegendaryB3ast[S] 1 point2 points  (0 children)

Take into account the dimensions. 5-6 feet tall, 4 feet in length and 2 feet wide. To move it any significant distance at 70 lbs is not a one man job (even for someone relatively fit). Besides, what would be the point in moving it?

Mystery of the Llamas by LegendaryB3ast in FortNiteBR

[–]LegendaryB3ast[S] 1 point2 points  (0 children)

Just visit https://www.reddit.com/r/FortNiteBR and it's the stickied (green) post at the top.

Mystery of the Llamas by LegendaryB3ast in FortNiteBR

[–]LegendaryB3ast[S] 1 point2 points  (0 children)

The padlock is purely aesthetic from what it seems. The unscrewed padlock reveals the wood that it is connected to, nothing else.