Difference between revisions of "Fifth row edge templates"
(→Fifth row edge templates with one stone: Fixed a nonsense sentence (left over from a limitation of earlier board diagrams).) |
(Fixed links.) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
== Fifth row edge templates with one stone == | == Fifth row edge templates with one stone == | ||
− | === [[ | + | === [[Edge_template_V1a|V-1-a]] === |
<hexboard size="5x10" | <hexboard size="5x10" | ||
Line 7: | Line 7: | ||
edges="bottom" | edges="bottom" | ||
visible="area(f1,c3,a5,j5,j3,h1)" | visible="area(f1,c3,a5,j5,j3,h1)" | ||
+ | contents="R g1" | ||
+ | /> | ||
+ | |||
+ | === [[Edge_template_V1d|V-1-d]] === | ||
+ | |||
+ | <hexboard size="5x13" | ||
+ | coords="hide" | ||
+ | edges="bottom" | ||
+ | visible="area(a5,m5,m3,k1,g1,c3)" | ||
contents="R g1" | contents="R g1" | ||
/> | /> | ||
Line 167: | Line 176: | ||
visible="area(d1,c2,a5,j5,j3,h1)" | visible="area(d1,c2,a5,j5,j3,h1)" | ||
contents="R d1 c2" | contents="R d1 c2" | ||
+ | /> | ||
+ | |||
+ | === V-2-n === | ||
+ | |||
+ | <hexboard size="5x9" | ||
+ | coords="none" | ||
+ | edges="bottom" | ||
+ | visible="area(c1,a4,a5,i5,i3,g1)" | ||
+ | contents="R arrow(12):c1,a4 B c2" | ||
+ | /> | ||
+ | |||
+ | === V-2-o === | ||
+ | |||
+ | <hexboard size="6x12" | ||
+ | coords="none" | ||
+ | edges="bottom" | ||
+ | visible="area(c2,a6,l6,l4,j2,f1,d1)" | ||
+ | contents="R arrow(12):c2,b4 B c3" | ||
/> | /> | ||
Latest revision as of 02:06, 1 November 2023
Contents
Fifth row edge templates with one stone
V-1-a
V-1-d
Although the next two templates take up 6 rows, they are considered 5th row templates because the stone to be connected is on the 5th row.
V-1-b
V-1-c
Fifth row edge templates with two stones
V-2-a
V-2-b
This template is called C-5 in Seymour's book.
V-2-c
This template is called J-5 in Seymour's book.
V-2-d
The shaded cell is not part of the template. It can be occupied by Blue.
V-2-e
This template is called D-5a in Seymour's book.
Red can choose to connect either stone to the edge, but Red cannot guarantee to connect both.
V-2-f
This template is called D-5b in Seymour's book.
Red can choose to connect either stone to the edge, but Red cannot guarantee to connect both.
V-2-g
This template is called L-5a in Seymour's book. Red can connect either one of the stones to the edge, but unlike template IV-2l, Red is not guaranteed to be able to connect them both.
V-2-h
This template is called L-5b in Seymour's book.
V-2-i
Red can choose to connect either stone to the edge, but Red cannot guarantee to connect both.
V-2-j
The shaded cell is not part of the template. It can be occupied by Blue.
V-2-k
V-2-l
V-2-m
V-2-n
V-2-o
Two stones on the fifth row
If Red has two stones on the fifth row with two or more empty hexes between them and the space shown below, Red can connect either one of the stones (at Red's choice) to the edge.
Red's strategy is as follows. Say Red wants to connect stone A to the edge. Then no matter where Blue plays, Red can get at least a 3rd row ladder from A. Red can then use stone B as a switchback to a 5th row ladder going in the opposite direction, which connects to A. For example:
Note that Red must choose to connect either stone A or stone B (Red cannot generally guarantee to connect them both). For example, if Blue plays here:
or here:
then Red can choose to connect A or B, but not both.