In the game Chomp, two players begin with a rectangular grid. Player 1 chooses any square and removes it from the grid, together with all the squares above and to the right of it. Player 2 chooses one of the remaining squares and removes that, together with all the squares above it and to its right. The two take turns in this way until one of them is forced to remove the last square. That player loses.
If the starting grid is square, can either player force a win?
Particle \(P_0\) is at \((0, 0)\) and particle \(P_1\) is at \((0, 1)\) at time \(t=0\). \(P_0\) moves right along the \(x\)-axis at speed \(1\) and \(P_1\) always moves directly towards \(P_0\), also at speed \(1\). In the long run, \(P_1\) will be moving right along the \(x\)-axis at speed \(1\), and so the distance between the two particles will no longer decrease. What is that final distance?
Issue 08 of Chalkdust is coming out on 19 October. Why don't you come along to our launch party? http://chalkdustmagazine.com/blog/chalkdust-issue-08-coming-19-october/
This has to be the weirdest setting for a sci-fi novel. This plot synopsis is so bizarre!
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!