My Forth evaluator passed all 46 tests and was still wrong. A mentor found the bug, I found the same one in my AWK solution, and my Java solution turned out to be right by accident. One exercise, three languages, and what a dictionary should store.
How we sped up exact 3d6 King-Capture Probability in our Scala 3 Dice Chess engine by up to 1,273x—moving from 56 per-roll DFS searches to a single 56-bit register broadcast and zero-allocation bitboard reachability.
For years, keeping Scala dependencies up to date had one obvious answer: Scala Steward. It is mature, Scala-native, and runs a free public instance that sends pull requests to open-source projects ...
In Dice Chess, the dice are the game. You roll, you get a pool of three values, and everything you can do that turn flows from those numbers. So when we moved the platform to a server-authoritative...
Almost nobody uses git hooks in Scala projects. I understand why: everything in the Scala world traditionally goes through sbt, and sbt means booting a JVM, loading plugins, and resolving a build —...
In my previous post, we explored how to generate moves for “Leapers” (Kings and Knights) using fast bitwise shifts. Because Leapers ignore other pieces, we could precalculate all their moves at sta...
Yesterday, I was explaining the architecture of my new Dice Chess Engine to a friend. We were talking about move generation — the core algorithm that determines where a piece can legally move. Whe...
I am currently building a high-performance Scala 3 search engine for a variation of chess called Dice Chess. When writing an engine that needs to traverse millions (or billions) of game states usi...
I am building a pet project called Dice Chess Lab. It is a monorepo comprising three distinct parts: a Python FastAPI backend, a Svelte frontend, and an Astro-based documentation site. As the sole...
Discover .editorconfig, the simple file that can end code style debates and unify formatting across your entire team. This guide explains why you need it and how to set it up.