Hacker News: pilord314

New comment by pilord314 in "MTG Bench: Testing how well LLMs can play Magic"

pilord314 — Fri, 12 Jun 2026 01:35:52 +0000

They should randomize games of judge tower and see who wins:

https://mtg.fandom.com/wiki/Judge_Tower

New comment by pilord314 in "SectorC: A C Compiler in 512 bytes (2023)"

pilord314 — Sat, 07 Feb 2026 23:46:48 +0000

you bootstrap it into a library you can include optionally, duh

New comment by pilord314 in "We put Claude Code in Rollercoaster Tycoon"

pilord314 — Sat, 17 Jan 2026 22:53:41 +0000

I've been playing around with an AI generated knowledge base to grok our code base, I think you need good metrics on how the knowledge base is used. A few things is:

1. Being systematic. Having a system for adding, improving and maintaining the knoweldge base 2. Having feedback for that system 3. Implementing the feedback into a better system

I'm pretty happy I have an audit framework and documentation standards. I've refactored the whole knowledge base a few times. In the places where it's overly specific or too narrow in it's scope of use for the retained knowledge, you just have to prune it.

Any garden has weeds when you lay down fertile soil.

Sometimes they aren't weeds though, and that's where having a person in the driver's seat is a boon.

New comment by pilord314 in "Ask HN: What are you working on? (January 2026)"

pilord314 — Mon, 12 Jan 2026 03:43:15 +0000

A disassembly diff tool:

input <- old_image new_image

output -> report

Example summary:

================================================================================

TOTAL

================================================================================

  -20 insns, -40 bytes (c.insn→insn +40b)  [spill -22, cmov +3, call -2, br -1]  mem +13, alu -6, mv -4, bitmanip -1

  Added/Removed: +0 / -220 bytes

  Functions: 4 better (-20 insns), 0 worse (+0 insns), 1 removed, 1062 unchanged

New comment by pilord314 in "When would you ever want bubblesort? (2023)"

pilord314 — Thu, 11 Dec 2025 06:03:03 +0000

When you get into C code sometimes you know the most thinngs that will be in the priority queue is like 3. So bubble sort is fine.

You can also do something like a calendar queue with bubble sort for each bin.