Games at Mumbai, Day 4 (Final) of Talks
Kyle (noreply@blogger.com)
The talks on the final day of Games At Mumbai continued the excellence of the week! Here are my summaries: Dhruv Basin, "On ergodicity of a 1-dimensional PCA with parity dependent updation rules" Dhruv talked about the site percolation problem--whether there are open clusters on randomly-generated graphs. In a game version of this, vertices (integer coordinates of the Cartesian plane, so the board is infinite) are randomly either a trap, a target, or open. Players alternate moving a token alo