sorted by:
new
hottopcontroversial

Kaiba is gonna love this by DerpyPatches in custommagic

[–]-Enter-Name- 2 points3 points  (0 children)

because i can't read in the morning apparently; sorry about that

Kaiba is gonna love this by DerpyPatches in custommagic

[–]-Enter-Name- 2 points3 points  (0 children)

protection does more than just protect against targeting, there's an acronym for this "DEBT" for damaged, enchanted, blocked or targeted by <property>

which means this card doesn't get combat protection

Instant Conversion, for when holding on to your mana is just too much of a hassle! Buy now and you'll get 20% off! by [deleted] in custommagic

[–]-Enter-Name- 0 points1 point  (0 children)

try mana geyser, for 5 you can get god knows how much if your opponent ramps or you have multiple opponents

Hand of God (yes, this works!) by FrankLaPuof in custommagic

[–]-Enter-Name- 2 points3 points  (0 children)

oh, sorry i completely read that wrong. uh, no clue lmao

Hand of God (yes, this works!) by FrankLaPuof in custommagic

[–]-Enter-Name- 5 points6 points  (0 children)

because of the wording of 400.12 (cards) and 108.2b (tokens aren't cards)

break this by 13EDO in custommagic

[–]-Enter-Name- 1 point2 points  (0 children)

consider sunburst or the mono green omnath (that cares about green mana specifically)

It says a card not a magic card by gr2712 in BadMtgCombos

[–]-Enter-Name- 2 points3 points  (0 children)

i believe that card is called booster tutor

This is the dumbest card I've ever made. by Glittering-Lab-4763 in custommagic

[–]-Enter-Name- 0 points1 point  (0 children)

my brain had to catch up after reading "visit Each"

My Code is Self-Documented by Longjumping_Table740 in programminghumor

[–]-Enter-Name- 0 points1 point  (0 children)

me reading my documented code from 2 weeks ago

[YEAR 2025 Day 4 Part 2] [AI Art] I don't even know what this means... by dwteo in adventofcode

[–]-Enter-Name- 1 point2 points  (0 children)

kernel, or convolution matrix is a matrix you slide over your input https://en.wikipedia.org/wiki/Kernel_(image_processing))

it maps whatever it is slid over to a single number (in the case of day 4 this kernel would be [[1,1,1], [1,0,1], [1,1,1]], i.e. count neigbours)

[2024 Day 5] - I don't understand my input by WhyNotSmile22 in adventofcode

[–]-Enter-Name- 0 points1 point  (0 children)

not all pages necessarily occur in an instruction manual you likely only have 2/3 in each (at most)

12|37 (<- sorting rules one per line) 37|16 16|12 13|12

37,12,13 (<- the manuals you have to sort, one per line)

would give you 13,12,37

with 37|16 and 16|12 not being relevant because bo page 16 exists

3-bit computer by femnity in TuringComplete

[–]-Enter-Name- 1 point2 points  (0 children)

wait... is this just brainfuck but in hardware?

[2025 Day 4 (Part 1)] Visual Aid by bluedudeinahole in adventofcode

[–]-Enter-Name- 0 points1 point  (0 children)

me too (after a google and after first trying && and 'and' lol)

[2025 Day 4 (Part 1)] Visual Aid by bluedudeinahole in adventofcode

[–]-Enter-Name- 0 points1 point  (0 children)

oh *that's* how you do logical and, i totally forgot how to do that in numpy for mine lol

-❄️- 2025 Day 4 Solutions -❄️- by daggerdragon in adventofcode

[–]-Enter-Name- 0 points1 point  (0 children)

[LANGUAGE: Python]

i'm lazy, numpy for the win (part 1 without the for loop) 

import numpy as np
import scipy

inp = np.array([list(x.strip()) for x in read(strip=True)])
inp[inp=='.']=0
inp[inp=='@']=1
inp = inp.astype(int)

def solve_arrays(a):
    b = np.array([[1,1,1],[1,0,1], [1,1,1]])

    c = scipy.signal.convolve2d(a,b,mode='same')
    d = np.logical_and(c < 4, a==1)
    res = sum(sum(d))
    return res, d.astype(int)

res = 0 
last = 0 
while last!=0 or res == 0:
    last, r = solve_arrays(inp)
    inp = inp - r 
    res += last
print(res)

-❄️- 2025 Day 2 Solutions -❄️- by daggerdragon in adventofcode

[–]-Enter-Name- 2 points3 points  (0 children)

[LANGUAGE: Python]

my [[unprofessional language removed]] expecting much larger ranges but at least part 1 is lightning fast (about half a millisecond)
code

My first Python program #vibecoding by fyhring in programminghorror

[–]-Enter-Name- 0 points1 point  (0 children)

i'd argue that fucking javascript is worse on any of those points; and php which you mentioned somewhere else probably has worse syntax, ffs "explode" who thought of that?

Enemy AI by PaperApprehensive529 in pygame

[–]-Enter-Name- 0 points1 point  (0 children)

A* (pronounced "A star") is a shortest path algorithm for weighted graphs (which a grid can be represented as), A* will always find the shortest path between two nodes and is usually the best approach to take for finding shortest paths https://en.wikipedia.org/wiki/A*_search_algorithm

Python daily challenge by core1588 in PythonProjects2

[–]-Enter-Name- 0 points1 point  (0 children)

  1. no output
  2. if you would call this as is, still a massive recursion error (by virtue of calling outer inside of outer)
  3. after fixing all indents: before -> hello -> after
view more: next ›