A vibe-coded playground for designing chess-like strategy games.
A vibe-coded playground for designing chess-like strategy games.
What it is, and how the score works, below.
The games added in the last two weeks, newest first, each one playable now. A game the computer players have not measured yet says so, rather than show a score.
Games members designed here and published, the newest first.
The shelf is empty so far. No member has published a game here yet; the first one goes here.
Build your ownA vibe-coded playground for designing chess-like strategy games. Vibe-coded means it was built by describing it, in plain language, to an AI that wrote the code, so expect a rough edge here and there. If it had been hand crafted, it would have been immaculate, obviously.
It is a place to invent games, play them, and find the ones worth playing. Chess is here too, as a familiar point of comparison.
Every game here is a mix of rules taken from one palette: the size and shape of the board (squares or hexagons, and edges that can join round like a cylinder), the pieces and how each one moves and takes, where they start, what happens to a piece that is taken (it can come back into play from your hand), promotion, and how a game is won: by checkmate, by checking three times, by reaching a square, and more.
The designer puts the palette in front of you as cards and boards, with no programming. Change a rule and the board answers at once: where each piece can go, and whether the rules still make a game.
Every game is playable in the browser straight away, against computer players from gentle to strong. No account is needed: a practice game has undo and restart, and counts for nothing. A game you are designing can be played the same way, before it is saved.
Members can challenge each other to a game by correspondence: each of you moves when it suits you, the site keeps the board, and it can send an email when it is your move. A game is lost by the player to move after five days without a move. With an account your games count: you get a rating on each game, and beating the strongest computer player on a game puts your name on it. Joining is by invitation for now.
Find a member by name, open their page to see the games they made and played, and challenge them from there.
Before a game is scored, eight computer players play it: one that moves at random, one that takes whatever it can, and six that look ahead, allowed to look at 100 to 6,400 positions before each move. Each meets every other, and a copy of itself, from both sides: 256 games a run. That is one run; a game in the library is measured four times, on four different sets of games.
A game is viable when it passes the basic tests of a working game: games finish, they are not almost all drawn or won by an opening trap, a player who thinks beats one who moves at random, thinking longer pays, and neither side wins just by moving first. A game that fails one is ruled out, however well it does elsewhere. The tests and their numbers are under the score below.
Every measured game gets a score out of 1 for how interesting it looks when the computer plays it. A game scores well when the stronger player usually wins, so skill pays; there are real choices on most turns; games don't stall or end in a few moves; a game can turn round; no two games go the same way; and the first player has no big edge.
It is a preliminary, evolving measure: the best estimate available of giving a game a single value, and not to be treated as a definitive judgement. The computer players are strong on games like chess and weaker on games won by a long plan, where they can miss what a person sees. So each score says what it rests on (0.810 · 4 runs, with a ± for how far chance alone could move it), each game says how far to trust its computer players, and most games are too close to put in order: the score tells a working game from a broken one, not first from second.
Scores are measured again as the computer players get stronger and as the scoring improves. Until a game is measured again, its old score stays on show, marked provisional, and it is never compared with current ones. If you beat the strongest computer player on a game easily, that is news about the score too.
These are the scoring rules in force now, version 12. Each of the eleven ingredients below is measured on the games the computer players played, and turned into marks from 0 to 1 on its own scale. Ingredients that answer the same question are averaged, the heavier ones counting for more, which gives six qualities, each out of 1. The qualities are then multiplied together, each raised to its weight, so one quality near zero pulls the whole score down instead of being outvoted: a game with nothing in it can look simple, varied and dramatic, and averaging let a deliberately dull test game score 0.64. No quality counts as lower than 0.02, so a game that fails one still differs from a game that fails three.
A weight is the share of the whole it carries; the weights of the ingredients add up to the weight of their quality.
Does thinking pay?
How much stronger a computer player gets each time it is allowed to think twice as long.
Why it counts. If more thought buys nothing, there is nothing to be good at. This is the biggest single ingredient, because skill paying is what makes a strategy game.
How it is worked out. The computer players that look ahead differ only in how many positions they may look at before each move. Each gets a rating from its results, and a straight line through the ratings, against how many times the thinking doubled, gives the rating points one doubling is worth. Chess measures about 120.
Its scale. Nothing at 8 rating points a doubling or less, rising in a straight line to full marks at 202 rating points a doubling or more.
Is there something to think about on most turns?
On a typical turn, how many of the moves on offer would cost you something.
Why it counts. Near none, every move is as good as any other and nothing needs thinking about; near all, there is one right move and the game is a puzzle. Of everything measured, it tells a broken game from a real one best.
How it is worked out. In positions taken from the games played, every legal move is scored the same way on every game, with the piece values the rules imply. This is the share of moves that come out clearly worse than the best one: worse by more than the cheapest piece is worth.
Its scale. Best in the middle: nothing at 0%, full marks from 29.5% to 65.3%, and nothing again at 100%.
Whether the pieces on the board at the start ever move at all.
Why it counts. Use of the army looks at kinds of piece and cannot see five of one kind sitting at the back while a sixth does all the work. A designer testing a new game named that failure, so it is counted.
How it is worked out. The share of pieces on the board at the start that move at least once in a game, over the games played. When few move the game is dull, and when every single one must, the game may be a slog.
Its scale. Best in the middle: nothing at 0%, full marks from 51.4% to 88.5%, and nothing again at 100%.
Whether every kind of piece gets used, or some are scenery.
Why it counts. A piece nobody moves is a rule that adds nothing to the game.
How it is worked out. Counts how many moves each kind of piece made, and measures how evenly they are spread, from 0 (one kind makes every move) to 1 (every kind moves as often as the others), so a game with three kinds of piece compares with one with nine.
Its scale. Nothing at 0.735 or less, rising in a straight line to full marks at 1 or more.
Are the choices a good size, and do games vary in length?
How many legal moves a player typically has.
Why it counts. Too few and there is nothing to decide; too many and a position is soup nobody can read.
How it is worked out. The number of legal moves, averaged over every turn of every game played.
Its scale. Best in the middle: nothing at 1.5 moves or less, full marks from 9.624 moves to 56.4 moves, and nothing again at 112.7 moves or more.
Whether games vary in length or always run about the same.
Why it counts. A game that always ends on the same turn is running a script.
How it is worked out. How far game lengths spread around their average, divided by the average, so a long game and a short one compare fairly: 0 is every game the same length.
Its scale. Nothing at 0 or less, rising in a straight line to full marks at 0.971 or more.
Can a game turn round, and does a lead mean something?
Whether one bad move ends the game.
Why it counts. If a single slip is always fatal, the game is a memory test; if nothing you do matters, it is not a game. It is noisy, but it tells broken games from real ones better than almost anything else here.
How it is worked out. A bad move is forced into a real position from a game played, and the game is played on from there. This is the share of those trials the side that slipped still saved.
Its scale. Best in the middle: nothing at 0%, full marks from 25% to 75%, and nothing again at 100%.
Whether being ahead is worth something.
Why it counts. If a lead means nothing, the middle of a game is noise; if the first real lead always wins, the rest of the game is a formality.
How it is worked out. Among the won games where one side was clearly ahead in material part of the way through, the share that side went on to win. When a run has too few such games, or the computer players cannot judge who is ahead in this game, it is left out rather than scored as zero.
Its scale. Best in the middle: nothing at 50% or less, full marks from 61.6% to 93.6%, and nothing again at 100%.
Do two games go to different places?
Whether each game goes somewhere the others did not.
Why it counts. If the same game keeps being replayed, there is little to explore.
How it is worked out. For each game where neither side moves at random, the positions it passed through are compared with the most similar other game. This is the share of positions the two did not have in common, averaged over the games.
Its scale. Nothing at 0%, rising in a straight line to full marks at 100%.
Is it fair to both sides, and do games finish?
How often a game is stopped by the turn limit or by a long run of moves with nothing taken, instead of reaching an ending its rules name.
Why it counts. A game that does not end is not a contest. Too many and the game is ruled out altogether.
How it is worked out. The share of games which are stopped this way, among those where neither side is the computer player that moves at random. A game drawn by repeating a position has reached an ending, so it does not count here.
Its scale. Full marks at 0%, falling in a straight line to nothing at 70% or more.
How much of an edge moving first is worth.
Why it counts. Both sides should be playing the same game. It counts for little, because it is the least certain thing measured: games differ on it by not much more than chance alone moves it.
How it is worked out. Only games where a computer player meets an exact copy of itself are read, so any difference comes from moving first. The first player's share of the points is compared with an even half.
Its scale. Full marks at 50% of the points, falling in a straight line to nothing at 75% of the points or more.
Some failings are not marked down but rule a game out: its score still shows, and means nothing. A game is viable when it passes all of these.
Where a test is about how games end, it is read twice, on the games of the weaker computer players and on those of the stronger ones, and the half that does worse is the one that counts: one set of rules can be an opening trap for weak players and a dead shuffle for strong ones, and averaged together each failing would hide the other. One more test asks whether the strongest computer players win from one side nearly every time, whichever of them sits there: then the side decides the game, not the play.
The site is made and run by one person. To get in touch, find them on GitHub at github.com/nabfrew.