Live data from Hacker News

Chess: Who will win in this riveting game of Math.random() vs. Math.random()?

chessboardjs.com

1–10 of 131 posts

Re: Chess: Who will win in this riveting game of Math.random() vs. Math.random()?

#5
post #3
post #2

Seems like it always queens pawns; I'd hoped to see some exciting random promotions :/.

Just saw it promote to bishop :)

Two bishops here. It gets boring when there is a few pieces left.. there is hardly any chance random will actually win - it will keep moving around forever.

Re: Chess: Who will win in this riveting game of Math.random() vs. Math.random()?

#7
Because check mate is a very small subset of possible moves at the end game, I'm guessing the vast majority of games will end(?) with 2 kings moving around randomly for all of time.

This assumes most games will make it past the hump of mid game where its possible the king's motion will be limited and a checkmate can erroneously happen, I suspect this is a rare case as well.

On a side note I wonder what kind of useful information could be mined from a huge set of random-random games. Maybe the relative power of each piece in terms of the number of pieces it captures on average? Also with some heuristic tweeks you could probably start exploring the power of various openings. Of course then its no longer random-random.

Post reply on HN