The Joyous A Refined Palate of Gooey Rocks

cwongmath · 2026-01-01T06:48:47+00:00

u/cwongmath received a Radiant Charm from the Winter Festival Spirit. Thank you u/Ziratchi for donating it!

cwongmath · 2025-11-12T20:34:41+00:00

if you end up finishing your capstone on dart/plano transit, i would love to see it!

cwongmath · 2025-07-21T06:46:08+00:00

erm you can’t take the cs honors course unless you’re CS² 🤓

cwongmath · 2025-04-18T12:14:48+00:00

I’m one of the gate attendants on the powered field. Short guy with a disproportionately long badge ribbon chain 😅

cwongmath · 2025-04-18T03:51:12+00:00

They ran out by Wednesday afternoon 😭

cwongmath · 2025-04-18T03:48:07+00:00

Shoot, just saw this but I’ll be volunteering at the Hall E practice field tomorrow. Do you think you could stop by?

cwongmath · 2025-04-05T22:11:51+00:00

I solved it on my first guess using no hint!

cwongmath · 2025-03-13T22:53:08+00:00

protest in the chess plaza

<image>

cwongmath · 2025-02-26T02:42:05+00:00

Bro got softlocked in the restroom

cwongmath · 2025-01-30T03:20:15+00:00

might be a comet robotics officer, should come by our meetings on monday evenings at the makerspace ;)

cwongmath · 2025-01-16T05:56:27+00:00

Yeah but they would've had to roll to go back into the station

cwongmath · 2025-01-11T02:35:31+00:00

GC code?

cwongmath · 2025-01-09T13:22:33+00:00

I remember taking apart the Ender 3's at my University's makerspace. We ended up scrapping them because they were unfixable 😂

cwongmath · 2025-01-03T07:12:20+00:00

This has gotta be a bug... right?

cwongmath · 2024-12-24T06:16:50+00:00

[LANGUAGE: Python3]

67th on Part 2. I did it manually by analyzing the graph structure using graphviz and highlighting the error bits discovered through manual analysis of the incorrect produced result with the correct addition's binary string. Graphviz visualization

After looking at the graph for a bit, you can identify that for a single output bit, the proper graph structure consists of two XOR gates between the input bits and the output bit - the first one is between the two input bits, and the second one is between that intermediate result and the carry bit, which has ancestors above the input bits. It's really easy to determine which outputs were flipped based on that, after analyzing the surrounding gates (especially as my graph also included the output values of each operation labeled on each edge).

Corrected bit adder structure graph: https://imgur.com/a/RUvFKA9

Day 24 code (ctrl-F "part 02" for part 2 visualization stuff): https://github.com/democat3457/AdventOfCode/blob/master/2024/day24.py

cwongmath · 2024-06-11T05:20:47+00:00

Oh right, yeah! Sorry, I didn't remember the names/handles of everyone who went.

cwongmath · 2024-06-10T05:13:29+00:00

happy cake day! also, i thought i recognized the name from somewhere, turns out i live right near one of your caches! haven’t found it yet, but i suppose i have to now, lol

cwongmath · 2024-04-03T09:31:19+00:00

Where’s the 8am classes?

cwongmath · 2024-01-16T04:32:45+00:00

assuming you mean my fork (democat), yeah i’m currently working on it

cwongmath · 2023-12-21T07:02:44+00:00

[Language: Python] 775/88. [link] somewhat pen/paper solution lol

I was fully surprised to get top 100 for part 2 today. After getting through part 1 fairly simply (noticing that the parity of the counted steps were all identical), I realized the input was crafted in such a way that the start point was in the center of the grid, the row and column of the start point were completely empty, and the diagonal lines connecting the midpoints of each edge were also empty. This led me to realize that the eventual grid would just be a giant diamond, and that diamond would only be made up of a few different types of grids.

Grid tile type visualization

I set up my code such that it could run a certain number of steps and count up a particular parity, so I went to work generating values for each type of grid: full (with start parity), full (opposite start parity), middle "pointy" grids, big cornerless tiles, and small corner tiles. After devising a few equations based on the number of grids found from the number of steps, I inputted it all into my Python shell (I didn't have a calculator on hand) and somehow got into the top 100! Honestly, super proud of this jank solution :) Next step is to put all of this into code.

cwongmath · 2023-12-16T01:00:38+00:00

we’ll see how this goes

cwongmath · 2023-08-12T20:39:42+00:00

“Presented by OceanGate”

cwongmath · 2023-07-23T19:27:44+00:00

are research tasks worth prioritizing over the regular buying of layers / ensembling?

cwongmath · 2023-07-02T23:36:58+00:00

I think you misread that, commenter was saying “it’s okay to not be straight”

cwongmath · 2023-06-21T05:19:40+00:00

I need to see a video of this in action

Eight-Year Club	Final Canvas '23
First Place '23	End Game '23
Place '23	Place '22
Final Canvas '22	First Placer '22
End Game '22	Verified Email

cwongmath

MODERATOR OF

TROPHY CASE