Hacker News: th1nhng0

New comment by th1nhng0 in "Show HN: Watch a neural net learn to play Snake"

th1nhng0 — Fri, 15 May 2026 17:08:49 +0000

cool project

Show HN: 518K Vietnamese legal documents (1924–2026)

th1nhng0 — Sun, 22 Mar 2026 18:09:55 +0000

I scraped and open-sourced a corpus of 518,255 Vietnamese legal documents — laws, decrees, circulars, decisions — spanning a century of legislation. Metadata + full Markdown text, ~3.6 GB parquet, CC BY 4.0. Vietnamese legal text is nearly absent from existing NLP datasets despite Vietnam having one of the more prolific legislative systems in Southeast Asia.

Comments URL: https://news.ycombinator.com/item?id=47480363

Points: 3

# Comments: 0

Show HN: Club Penguin made by Google Gemini 3

th1nhng0 — Tue, 18 Nov 2025 23:21:34 +0000

Article URL: https://gemini.google.com/share/f52d257f7c6b

Comments URL: https://news.ycombinator.com/item?id=45973637

Points: 3

# Comments: 1

New comment by th1nhng0 in "Show HN: I modeled the puzzle game Railbound with Constraint Programming"

th1nhng0 — Wed, 15 Oct 2025 08:17:51 +0000

Thanks, these are all excellent suggestions.

The "distance to goal" constraint is a clever idea, though it's tricky to implement because the tunnels act as teleporters, so a simple distance metric doesn't apply. I'd likely need to pre-calculate a shortest-path graph first.

I'm benchmarking Huub and Pumpkin now. My main goal is raw performance, as a friend's imperative brute-force solver (https://github.com/FoxtrotOnce/RailboundSolver) solves most levels in under 2 seconds. It's a high bar to meet with a declarative model, but I'm keen to see how close I can get with these optimizations.

I've also just pushed some initial benchmarks for Chuffed vs. OR-Tools to the repo if you're interested (https://github.com/Th1nhNg0/railbound_cp/tree/master/docs/be...). Thanks again for the great feedback!

New comment by th1nhng0 in "Show HN: I modeled the puzzle game Railbound with Constraint Programming"

th1nhng0 — Wed, 15 Oct 2025 05:05:27 +0000

Thanks for the great feedback! I didn't know OR-Tools CP-SAT worked best with at least 8 threads; I'll definitely try that out.

In my local tests, Chuffed is often faster on the simpler instances. However, I've noticed on the harder puzzles, Chuffed can take over 10 minutes, while OR-Tools (with just 4 threads) solves them in about 5.

You're also right about the records. I started with tuples for simplicity, but as the model grew more complex, it's clear that records would be a much better approach for readability.

Show HN: I modeled the puzzle game Railbound with Constraint Programming

th1nhng0 — Wed, 15 Oct 2025 03:02:14 +0000

Hi HN, I've been working on a solver for the puzzle game Railbound and wanted to share it.

The backstory is that I'm a big fan of the game and was curious if I could model its logic using constraint programming. I used MiniZinc to build it. The project treats each puzzle as a constraint satisfaction problem—it defines the rules of the game (how tracks connect, how switches work, etc.) and then searches for a layout that solves the level.

It's different from other solvers because it's a declarative model rather than an imperative search algorithm. It was a fun challenge to translate mechanics like timed gates, dynamic switches, and decoy cars into formal constraints.

You can run it on your own machine. The repo has instructions, but the basics are: 1. Install the MiniZinc IDE/toolchain. 2. Clone the repo. 3. Run a command like minizinc --solver or-tools main.mzn data/1/1-1.dzn

The project is open source and currently solves the first 8 worlds of the game.

Repo: https://github.com/Th1nhNg0/railbound_cp

I'm here to answer any questions. I'd love to hear your feedback.

Comments URL: https://news.ycombinator.com/item?id=45587666

Points: 2

# Comments: 4