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.

FizzBuzz and the art of filtering Stream API-based Tasks Inspired by the Classic Problem The FizzBuzz problem is a classic coding challenge often used in programming interviews. It is usually pre...

This task was proposed to me in one of the Java courses. In this article, I present my solution and analyze its efficiency. IP address processing is necessary for many projects, and I hope that the...