<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>hibikir</author><text>It&amp;#x27;s not just random vs random. Two extremely weak players will take hours to finish a won game, because the player with the major material advantage does not know how to win!&lt;p&gt;When teaching kids, it&amp;#x27;s not uncommon to, after teaching them how to move all the pieces, spend time teaching them how to perform the most basic of mates: KQ vs K, KRR vs K, KR vs K. Only after those three are mastered we have a good opportunity of having beginner games ending in anything other than a stalemate.</text><parent_chain><item><author>acadien</author><text>Because check mate is a very small subset of possible moves at the end game, I&amp;#x27;m guessing the vast majority of games will end(?) with 2 kings moving around randomly for all of time.&lt;p&gt;This assumes most games will make it past the hump of mid game where its possible the king&amp;#x27;s motion will be limited and a checkmate can erroneously happen, I suspect this is a rare case as well.&lt;p&gt;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.</text></item></parent_chain></comment><story><title>Chess: Who will win in this riveting game of Math.random() vs. Math.random()?</title><url>http://chessboardjs.com/examples#5002</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>TillE</author><text>I saw one game quickly become a lone white king against six black pieces. The king eventually captured three of them, and then the game gave up after some number of fruitless moves.&lt;p&gt;Even with that advantage, black couldn&amp;#x27;t randomly stumble across checkmate.</text><parent_chain><item><author>acadien</author><text>Because check mate is a very small subset of possible moves at the end game, I&amp;#x27;m guessing the vast majority of games will end(?) with 2 kings moving around randomly for all of time.&lt;p&gt;This assumes most games will make it past the hump of mid game where its possible the king&amp;#x27;s motion will be limited and a checkmate can erroneously happen, I suspect this is a rare case as well.&lt;p&gt;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.</text></item></parent_chain></comment><story><title>Chess: Who will win in this riveting game of Math.random() vs. Math.random()?</title><url>http://chessboardjs.com/examples#5002</url></story>