Compare revisions: 1973_Sackson_031_January 11.jpg
This revision marked as completed. |
|||
---|---|---|---|
Line 39: | Line 39: | ||
are down, players in turn move a pc. to another position in the | are down, players in turn move a pc. to another position in the | ||
recess. A pc. that has just been played cannot be moved. | recess. A pc. that has just been played cannot be moved. | ||
First to get 3 of his color in a row vertically or diagonally wins. | |||
When 3 or 4 play the pcs. have 4 active colors and 1 | |||
white. The arrangements are different and again not fair. | |||
When 4 play each gets one pc. which are placed in the | |||
same way. When 3 play one pc. is placed at random | |||
and the other 3 are placed by the players. The unused | |||
color is neutral. | |||
<br>(The 4-hand game seems that it can't end except by an error. | |||
This is probably true of the 3-hand. Claude and I played 2- | |||
hand he has was able to force a win. | |||
<br><u>PATH-A-LOGICAL</u> (which Anne objected to, but Claude never mentioned | |||
<u>PATHS LOGICAL</u> to Wexler). There is a 5x5 field. Object is | |||
to form a row of pieces connecting any two opposite edges. | |||
Each player has 10 pieces of his color. In a turn a player | |||
either places a pc. in a space or moves one already placed to | |||
another space - any other <s>permissible</s> empty space or one with | |||
1 pc. on it. A pc. can always be placed on top of another, to a | |||
maximum pile. | |||
<br>In order to win Wexler had the necessity of a connected orthogonal | |||
path. Claude felt that diagonal connections would | |||
<br>(cont. on 1/1) |