Board Thread:Funsies and Randomies/@comment-33521817-20191101140758/@comment-37322933-20191104135755

TLHP, I accuse you of being e

You have 68 choices, each of which are determined by the following formula:

1. Two chess matches are played, in which all moves on both sides are randomized except for escaping check, and that black's king-side bishop may not be moved.

2. Assuming every square is numbered one through sixty-four, starting from the black king-side rook and going to the right and then down, etc: - All squares with a white piece in one match and no piece in the other at the ends of the games add one count of "die" to their respective choice. - All squares with a black piece in one match and no piece in the other at the ends of the games add one count of "explode" to their respective choice. - All squares with a white piece in both matches at the ends of the games add one count of "pay sixty-eight hundred USD" to their respective choice. - All squares with a black piece in both matches at the ends of the games add one count of "be incarcerated for life" to their respective choice. - All squares with a white piece in one match and a black piece in one at the ends of the games add one count of "derive Cramer's rule in a four-variable equation" to their respective choice. - All squares with no pieces in either match at the ends of the games add one count of "your mom" to their respective choice.

3. This is repeated twelve times and six half-times, where half-times mean that the games will run fully, and then the games will retroactively end at the moves that marks 50% completion of all the games' moves.

I love wasting my time on stupid shit instead of doing homework :)