• fox [comrade/them]@hexbear.net
    link
    fedilink
    English
    arrow-up
    5
    ·
    3 个月前

    Yes, chess can be solved by simply knowing every possible board state. However there’s like 10^50 possible positions (we think, it’s actually unknown how many possible legal positions there are) and storing that amount of information would require more than the sun’s volume in hard drives

    • Belly_Beanis [he/him]@hexbear.net
      link
      fedilink
      English
      arrow-up
      3
      ·
      3 个月前

      sun’s volume in hard drives.

      Even that might not be enough lol. There are more possible moves than there are atoms in the universe. If you get rid of what are likely illegal moves, it’s (as you say) around 10^50. The space needed to even compute that, however, would be larger than our entire galaxy even with the most efficient computer possible that doesn’t exist.

      Go has over 10^170 moves, which is even more of a challenge to compute.