oessessnex

5 ms·

1. 1.▲
   by oessessnex 2y ago

   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
2. 2.▲
   by oessessnex 2y ago

   In OCaml the integer operations are implemented using LEA instructions, and the floats are boxed. The language is not really suitable for numerical code...
3. 3.▲
   by oessessnex 2y ago

   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&#x2F
4. 4.▲
   by oessessnex 3y ago

   Yes, except things mostly made by a single company, especially if it is VC founded.
5. 5.▲
   by oessessnex 3y ago

   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 ra
6. 6.▲
   by oessessnex 3y ago

   It's even simpler than that. You can randomly generate a valid sequence of moves (i.e you are a pawn at a2, move to a3, become knight, move to ..., move to ..., become ..., ...), instead of the initial board state and that guarantees t