oessessnex

You don't play by checking all possible moves on every turn like a machine. It's mostly intuition based, but it takes a while before it develops.

Also there are levels to this game, the range of players that is fun to play against is kind of narrow, outside of that you either obliterate or get obliterated.

In OCaml the integer operations are implemented using LEA instructions, and the floats are boxed. The language is not really suitable for numerical code...

Yes, Nix doesn't actually ensure that the builds are deterministic. In fact it works just fine if they aren't. There are packages in nixpkgs that aren't reproducible: https://github.com/NixOS/nixpkgs/issues?q=is%3Aopen+is%3Aiss...

Yes, except things mostly made by a single company, especially if it is VC founded.

I implemented a partial generator based on the idea in my previous comment. It was quite a fun challenge.

At each step it determines the reachable squares for the given piece, that are not occupied or block past moves, and chooses one at random, then it computes the shortest path to that square. This procedure is repeated until there are no squares available.

Only pawns, knights and kings are supported so far.

https://gist.github.com/oessessnex/bc617095675da44f857216f98...

Great game btw :)

It's even simpler than that. You can randomly generate a valid sequence of moves (i.e move to a3, become knight, move to ..., move to ..., become ..., ...) instead of the initial board state and that guarantees the puzzle is solvable.