• jaybone@lemmy.world
    link
    fedilink
    arrow-up
    41
    ·
    8 months ago

    That has a finite number of moves. And then you could possibly generate the code based on that finite set.

    • Shard@lemmy.world
      link
      fedilink
      arrow-up
      42
      ·
      8 months ago

      Chess technically has a finite number of moves. Although its a huge number and some have theorized its larger than the number of atoms in the known universe.

      • Albbi@lemmy.ca
        link
        fedilink
        arrow-up
        11
        arrow-down
        4
        ·
        8 months ago

        Technically it’s infinite, but that’s because of a stalemate. You can keep repeating the same moves over and over.

          • my_hat_stinks@programming.dev
            link
            fedilink
            arrow-up
            10
            ·
            8 months ago

            It’s not just repeated moves, a draw can be called if the board is in the same state 3 times at all during the game; if you get to the same position 3 times using different moves that still counts, even if it was a white move the first two times and a black move the third.

            The game also ends after 50 moves with no captures or pawn moves so you can’t play indefinitely by just avoiding those board states. Interestingly those two moves also make it impossible to return to a previous board state (pawns can’t move backwards, extra pieces are never added) so if you’re enforcing both rules in code you can safely discard previous board states every time you reset the move counter.

          • jaybone@lemmy.world
            link
            fedilink
            arrow-up
            4
            ·
            8 months ago

            But it’s a state machine, and you could easily contrive scenarios for infinite moves, without stalemate.