491
Coding chess (startrek.website)
submitted 2 years ago by to c/anarchychess@sopuli.xyz
48 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] 3 points 2 years ago (1 child)

I guess, maybe?

I'm not prepared to speculate on the performance of a computer literally larger than the universe.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 1 point 2 years ago (1 child)

    that's the most fun type of speculation. No fun speculating over computers that could emulate realistic things like all states of a rubiks cube, cause that's probably already been done.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 1 point 2 years ago* (1 child)

    ...hey, wait a second, you pulled a fast one on me with that "100 million states/s" silliness!

    I just remembered what the time boundary I was talking about was actually trying to measure: it had nothing to do with the speed of computation; it was the speed of typing in the program code. That's why 1 state per second was a reasonable estimate (if not overly optimistic). If you tried to type in all those ifs and prints manually, that's what would take you longer than the heat death of the universe.

    Besides, even executing the program can't do 100 million states per second because it only does one state transition and then waits for user input.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •