• Lovable Sidekick@lemmy.world
    link
    fedilink
    English
    arrow-up
    32
    arrow-down
    3
    ·
    2 days ago

    This reminds me of one of my very first programs, a tic-tac-toe game I wrote in high school. It displayed hardcoded grids of Xs and Os and blanks very similar to what’s shown here. This approach worked because of the much more limited move possibilities. The program could always win if it made the first move, and always win or tie if the human moved first, depending on if the human made mistakes. I wish I still had the code.

      • Lovable Sidekick@lemmy.world
        link
        fedilink
        English
        arrow-up
        2
        ·
        2 days ago

        I’m probably remembering it wrong, it was a long time ago. It definitely always either won or tied but could never lose, because it knew the right responses to every move. No, it didn’t cheat lol.

          • Couldbealeotard@lemmy.world
            link
            fedilink
            English
            arrow-up
            1
            ·
            1 day ago

            There are no invalid locations in tic Tac toe, passing a turn provides no advantage, I suppose you could take extra turns to cheat.

            • rat@lemmy.dbzer0.com
              link
              fedilink
              arrow-up
              1
              ·
              38 minutes ago

              An invalid turn would be something like placing a move on top of an already-filled square or outside of the 9 grid spaces. It seems obvious to a human that you can’t do these things, but computer bugs have a tendency to do things you don’t expect. And yes, passing a turn doesn’t provide an advantage, but I listed it because it’s still technically cheating.