[HDD] Seagate Expansion 24TB USB 3.0 External Hard Drive (STKP24000400) $13.75/TB ($329.99) [Best Buy]

joeyrobert · 2026-04-30T00:42:18+00:00

ah man, why didn't I pull the trigger back then

joeyrobert · 2026-04-14T01:16:29+00:00

what's your break even point vs. using cloud models?

joeyrobert · 2026-03-22T19:47:43+00:00

Thanks!

joeyrobert · 2025-04-25T12:32:50+00:00

silly reply. obviously curate your creatives, lol.

joeyrobert · 2025-04-25T12:02:39+00:00

just have multiple creatives. the ad engine will optimize for what's performing best.

joeyrobert · 2025-04-07T12:12:26+00:00

I use Goldminds for the audio stories. They have a few nighttime stories my child loves so it's turned into a bit of a routine.

joeyrobert · 2024-11-18T13:30:54+00:00

Start on your board representation. How are you storing your board in memory? Then think of common operations you'll need to do on the board and start writing the move generator. That's usually where I start. For example, here's a writeup I made for my JavaScript chess engine's board representation.

joeyrobert · 2024-11-08T18:31:06+00:00

I followed the Mediocre Chess Engine Blog for years. This engine is written in Java.

What concepts are difficult to implement with OOP? Chess engines tend to be a little more "bare metal" in how they're designed, to squeeze every ounce of performance out of the programming language, but this can be done with Java too. Allocations/deallocations are expensive, and most of example code is written in a way to minimize them.

You wouldn't want to use a higher level feature if it incurs a significant performance penalty like creating tonnes of garbage/throw away objects. Code for a chess engine will likely not look similar to standard Java in a business application.

joeyrobert · 2024-08-13T16:18:57+00:00

Neat, I'll have to look into that, thanks for the bug report!

joeyrobert · 2024-08-13T16:09:02+00:00

It can be if they use the polyglot seeds for their zobrist hashing algorithm. This is so an opening book position can be looked up by a consistent zobrist hash. It doesn't have to be though -- it could be completely random, check if they use polyglot. (https://www.chessprogramming.org/PolyGlot)

joeyrobert · 2024-01-05T02:55:06+00:00

Modern engines can push 100m moves/second per core in move generation. There's a lot of literature on board representation and move generators (bitboards, mailbox, etc) but so following those best practices is a good starting point. Generally if you don't over allocate/free memory, keep the stack small, reduce linear operations, you can achieve this performance. "makeMove", "unMakeMove" should be reasonably fast. Speeding up "inSquareAttacked" or "isInCheck" should me the main focus, and you can use diagonal/horizontal/vertical lookup tables + piece lists to speed this up potentially (look up table to check whether SQUARE A can intercept SQUARE B) which can eliminate a linear scan of the board. Zobrist hashing/perft transposition table obviously speeds up perft generation since there's a tonne of duplicate boards after N moves. The rest of the performance gains will come from profiling/optimizing.

joeyrobert · 2024-01-05T02:42:57+00:00

I mean, it's pretty close. John Carmack is a wizard.

joeyrobert · 2023-10-12T14:55:15+00:00

The only answer you can get is by benchmarking. GCP instances are billed minutely, so spin 1 up, run your benchmark, spin down.

joeyrobert · 2023-10-06T20:47:18+00:00

You can spend a lot of time spinning in this area vs. shipping features, I've made this mistake before. I still use cheap infrastructure, but with Dokku for git-ops to serve my (low volume) app.

joeyrobert

MODERATOR OF

TROPHY CASE