Dominatrix -- Simple grid game
in [Math]
|
Prev: SQUARED CENTER AND CURVED CENTER_ At the request of a professor of Mathematics
Next: Help with set theory proof, please
From: James Dow Allen on 27 Jul 2010 12:03 On Jul 27, 5:19 pm, Leroy Quet <qqq...(a)mindspring.com> wrote: > James Dow Allen wrote: > > Too bad the game isn't on a torus topology! > > Then there'd be only two distinct first moves! > > Isn't it just one distinct first move with torus topology? It's your game, but doesn't the first move on 4x4 consist of placing an 'X' and then uttering '1', '2' or '3'? Uttering 1 is equivalent to uttering 3, but not 2. On Jul 27, 9:14 pm, Mark Steere <markste...(a)gmail.com> wrote: > Three inadequacies?? Dammit that sucks. I had such high hopes for > Connect 4 Popout. Buy my book! I have a chapter on Popout with amended rules, example games, and strategies. My amended rules are: (1) When PopOut leads to 4-in-line of *both* colors, Popper wins. (Hasbro claimed this was rare, but it happened almost every game when my son and I started playing!) (2) When the board is full, player has the option of popping or declaring a draw. (3) Repetition of moves (which *can* arise in well-played games) are settled by the same 3-time rule as in chess. James Dow Allen
From: Leroy Quet on 27 Jul 2010 14:40 James Dow Allen wrote: > On Jul 27, 5:19 pm, Leroy Quet <qqq...(a)mindspring.com> wrote: > > James Dow Allen wrote: > > > Too bad the game isn't on a torus topology! > > > Then there'd be only two distinct first moves! > > > > Isn't it just one distinct first move with torus topology? > > It's your game, but doesn't the first move on 4x4 consist > of placing an 'X' and then uttering '1', '2' or '3'? > Uttering 1 is equivalent to uttering 3, but not 2. > Oh, you are talking about FULL moves (x plus declaration). I was just talking about the placement of the x. Thanks, Leroy Quet
From: Mark Steere on 27 Jul 2010 17:39 On Jul 27, 9:03 am, James Dow Allen <jdallen2...(a)yahoo.com> wrote: > > Buy my book! Uh... no. > I have a chapter on Popout with amended rules, I got your popout right here.
From: James Dow Allen on 27 Jul 2010 20:36 On Jul 27, 4:55 pm, James Dow Allen <jdallen2...(a)yahoo.com> wrote: > I may write a brute-force solver ... Seemed to work, but not certifiable. To win the 3x3 game, first player plays anywhere but center and declares 2. In 4x4, the three winning first moves are . X . . Declare 3 . . . . . . . . . . . . or X . . . Declare 2 or 3 . . . . . . . . . . . . In 5x5, there are 20 distinct first moves, 15 of which win. I wrote (almost) the simplest possible brute-force solver. (I was too slothful even to include a transposition cache.) It solved the 4x4 in about one-quarter of a second, and all starting moves in the 5x5 in 89 minutes. More interesting of course would be to analyze the game heuristically. If no unreachable holes develop, 1st player wins with odd number of empty cells, and indeed most 1st moves lose on 4x4, but win on 5x5. James Dow Allen
From: Mark Steere on 27 Jul 2010 21:26
James Dow Allen wrote (via email): > Hi Mark, >> I got your popout right here. > Are you saying you have a preprint copy of my book already? > May I ask where you got it? I found it at a clearance sale, in the "Don't bore us with inadequate Hasbro games" section. |