Return to revision history
Revision as of 17:46:16, 22 July 2023 by Lboland
First draft
Revision as of 10:50:21, 3 August 2023 by LKinsman
Fixed typos
This revision marked as completed.
This revision marked as approved.
Line 1: Line 1:
9/29
<br>10/1
<br>-9
<br>-10
<br>30 SATURDAY - SEPTEMBER 1972
<br>274TH DAY - 92 DAYS TO COME


----
Rcd. [received] a letter from <u>Earl Perel</u>. He wonders if I have called about
the insurance <u>GAME</u> yet - and wants me to return the card.
Took 3 copies of <u>''AGOG''</u> (2 for <u>Graeme</u> to use with pub-
lishers and one for <u>Don Turnbull</u>), a copy of <u>THE NEXT PRESIDENT</u>,
and wrote a short letter to Don mentioning <u>SLEUTH</u>,
<u>MONAD</u>, <u>VENTURE</u>, <u>ALBION</u>, <u>SQUARRUMS</u>, and <u>SPACE SHOOTERS</u>. Met
<u>Graeme Levin</u> at 242nd St., gave him the material, and drove to
<u>Martin Gardner</u>.
I looked at <u>''GAMES PLAYING WITH COMPUTERS''</u> ^by A.G. Bell (London - George Allen &
Unwin Ltd. - 1972). Among a lot of other games analysed there were -
<u>GUESS IT</u> (analysed by R. Isaacs). This is completely explained
in Martin's column of 12/67.
<u>GRUNDY'S GAME</u>. Pule of objects. Two players in turn divide a pile
into two unequal sections, constantly making more piles. Last to
divide a pile wins. Or "misere" - player unable to divide wins.
I looked at <u>''NEW MATHEMATICAL PASTIMES''</u> by Major <u>P.A. MacMahon</u>. There
doesn't seem to be much that isn't in Martin's Columns.
Looked at <u>''MATHEMATICAL SNAPSHOTS''</u> by H. Steinhaus (Oxford Uni-
versity Press - New York - 1969 - - $7.50). Just glanced at it
since Martin mentioned it as a basic book on Recreational
math together with Kraitchik's <u>''MATHEMATICAL RECREATIONS''</u> and
Ball's <u>''MATHEMATICAL RECREATIONS AND ESSAYS''</u>.
Martin said that the two Dover books of Dudeney's puzzles -
<u>''AMUSEMENT IN MATHEMATICS''</u> (which I have) and <u>''THE CANTERBURY PUZZLES''</u>
(which I don't) plus <u>''536 PUZZLES & CURIOUS PROBLEMS''</u> covers every-
thing that Dudeney did.
Topological proof that <u>LOONY LOOPS</u> is solvable.
[drawing of a horizontal line with figure 8 at each end and a C in the middle] four loops shrunk - 2 at each end.
Looked at the material on <u>FOCUS</u> from <s>Martin Gardener's</s>
<u>''MARTIN GARDNER'S SIXTH BOOK OF MATHEMATICAL GAMES FROM SCIENTIFIC AMERICAN''</u>
(of the previous 5 one is on Dr. Matrix). The book should be
coming out in paperback next year.
<u>Conway</u> looked thru all Martin's games from readers. The one
that excited him was one by <u>Jim Bynum</u>, [address]
(The name sounded familiar.)
The <u>GAME</u> is played with a number of objects set up
in an n x n array (tho I think n x m could be used). One
player takes from the rows, the other from the columns.
Player can choose which row on column they wish but must
take all in it. However if there is a break the row or col-
umn does not go thru it. Don't remember, but probably can be
played with player taking last winning, or with a
"misere."
[drawing of 4 x 4 circles with numbers in them. Row 1: 8, 2, 4, 5. Row 2: 3, 2, 4, 9. Row 3: 1, 1, 1, 1. Row 4: 6, 7, 7, 7.]
In sample the player making the odd moves takes
from rows, the making the even moves takes
from column.
In answer to <u>Graeme's</u> request <u>Martin</u> said that he is pro-
(cont. on 9/29)