Simon McGregor on Wed, 28 Jul 2010 06:13:23 -0700 (MST)

 [game-lang] Another quick tangential comment about integers and reals

• To: A list for developing a game representation language <game-lang@xxxxxxxxx>
• Subject: [game-lang] Another quick tangential comment about integers and reals
• From: Simon McGregor <londonien@xxxxxxxxx>
• Date: Wed, 28 Jul 2010 14:13:18 +0100
• Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=lyCswQsvthOIIwrrg6wd2pKfEaJBxkQ1/SbIqf3IJOcfSpI/jHOHTnC0wptYP60kUp 2Yz/J9KjK96o8ttdT77Bxhu4fM+CgT75jDDT8UXVNYhrMMMIl9NIt3mQXLb7IaqEaHfc 7ChbNSvnHsoLm1hsF6mTHuh/XTsB3vKPBgK4c=

```Some friends and I occasionally played a game of my design (for 3 or
more players) which used the integers. The rules are simple: each
player secretly chooses an integer and all choices are revealed
simultaneously. If the choices are all different, the player who chose
the second-highest number wins. If any choices are the same, and one
player chose a higher number than all the others, that player wins. If
two players are tied for the highest choice, nobody wins. (I didn't
try to analyse this game properly!)

In regard to rationals and reals, imagine the following: a game is
played by moving points on a board in R2, up to 1 unit's distance at a
time (with the Euclidean metric). We can model this using the
rationals, because rational arithmetic is adequate to determine
whether two points with rational coordinates are within a rational
distance of one another.
However, suppose that the provably optimal move in some situation is
to move your point as far as possible towards another point. Then (in
general), no move in the rational model is optimal, although there's
an optimal move in the continuous model. Uh-oh!

Simon
_______________________________________________
game-lang mailing list
game-lang@xxxxxxxxx
http://lists.ellipsis.cx/mailman/listinfo/game-lang

```