Difference between revisions of "Pivoting template"

From HexWiki
Jump to: navigation, search
(Add clarification/correction)
(Fix the flawed statement. Also extend some statement to the weak version.)
 
(4 intermediate revisions by 2 users not shown)
Line 54: Line 54:
  
 
=== 3rd row ===
 
=== 3rd row ===
 
<hexboard size="3x3"
 
  coords="none"
 
  edges="bottom"
 
  visible="area(a3,c1,c3)-c2"
 
  contents="R A:c1 E B:c3"
 
  />
 
  
 
<hexboard size="3x5"
 
<hexboard size="3x5"
Line 77: Line 70:
  
 
=== 4th row ===
 
=== 4th row ===
 
<hexboard size="4x4"
 
  coords="none"
 
  edges="bottom"
 
  visible="area(a4,d1,d4)"
 
  contents="R A:d1 E B:d3"
 
  />
 
  
 
<hexboard size="4x6"
 
<hexboard size="4x6"
Line 187: Line 173:
 
   />
 
   />
  
== Pivoting templates and flanks ==
+
<hexboard size="6x10"
 
+
Pivoting templates can be useful in many situations, but are especially useful in connection with [[flank]]s.
+
Specifically, if we line up points A and B of any pivoting template with points A and J of a capped flank, we obtain a guaranteed connection to the edge. For example, consider the capped flank
+
<hexboard size="4x4"
+
  edges="none"
+
 
   coords="none"
 
   coords="none"
  visible="-a1 a2 b1 d4"
 
  contents="R A:a4 b2 c1 E J:c4"
 
  />
 
Attaching this on top of one of the above pivoting templates, we get the following:
 
<hexboard size="8x8"
 
 
   edges="bottom"
 
   edges="bottom"
  coords="none"
+
   visible="area(a6,c4,e3,f3,h1,j1,j2,h6)-i1"
   visible="area(d4,b6,a8,g8,g4,h3,h1,g1)"
+
   contents="R A:h1 E B:j1 R h3"
   contents="R A:e4 f2 g1 S area(d4,b6,a8,g8,g4)-f4 E B:g4"
+
 
   />
 
   />
This guarantees that Red can connect A to the edge, because either A will connect outright, or else B connects to the edge and also to A via the flank.
 
 
== If A and B [https://www.hexwiki.net/index.php/AND_and_OR_rules#Connections_and_semi-connections semi-connected] ==
 
 
The following arguments only apply when the semi-connection does not overlap with the template. However, if there is an overlap, these properties may still hold.
 
 
=== Connecting B with sente ===
 
 
If A and B are semi-connected and blue decides to block red from connecting A, red not only gets to connect B, but also gets [https://www.hexwiki.net/index.php/Initiative sente]. This is because once red connects B, blue will have to spend a move blocking B from connecting back to A.
 
 
=== Deriving normal templates ===
 
 
A normal template for connecting A can be derived from a pivoting template by placing a red stone in B, and adding sufficient space for A and B to be semi-connected. This is because, by definition, if blue tries to block A from the edge, red can connect B. However, if red already has a stone at B, they can spend that move connecting back to A.
 
  
 
== Weak pivoting templates ==
 
== Weak pivoting templates ==
Line 252: Line 214:
 
             S area(b9,h9,h5,e5,c7)-g5"
 
             S area(b9,h9,h5,e5,c7)-g5"
 
   />
 
   />
 +
 +
== Weak pivoting templates with an extra semi-connection ==
 +
 +
Suppose apart from the (weak) pivoting template, there is an extra [https://www.hexwiki.net/index.php/AND_and_OR_rules#Connections_and_semi-connections semi-connection] between A and B that does not overlap with the template, then the following holds when taking the semi-connection into consideration.
 +
 +
=== Connecting B with sente ===
 +
 +
If Blue decides to block Red from connecting A, then Red not only gets to connect B, but also gets a [https://www.hexwiki.net/index.php/Initiative sente]. This is because once the connection from Red B to the edge is ensured, Blue will have to spend a move blocking B from connecting back to A through the semi-connection.
 +
 +
=== Deriving pre-templates ===
 +
 +
Placing a red stone at B results into a pre-template connecting A to the edge. This is because, by definition, if Blue tries to block A from the edge, Red will play B at some moment from the strategy of the original (weak) pivoting template. However, if Red already has a stone at B, they can spend that move connecting B back to A through the semi-connection, and the rest of the strategy will connect either A or B to the edge, which means A is gauranteed to be connected to the edge.
 +
 +
It is not true that the pre-template is always a template. For example, if we consider the following pivoting template with a red stone at B and with an extra cell at *, then the result is not a template; the cells with + can be removed.
 +
 +
<hexboard size="5x9"
 +
  coords="none"
 +
  edges="bottom"
 +
  visible="area(a5,i5,i3,h1,e1)"
 +
  contents="R A:e1 B:g1 E *:f1 +:i3--i5"
 +
/>
 +
 +
== Weak pivoting templates with an extra virtual connection ==
 +
 +
Suppose apart from the (weak) pivoting template, there is an extra [https://www.hexwiki.net/index.php/AND_and_OR_rules#Connections_and_semi-connections virtual connection] between A and B that does not overlap with the template, then they form a pre-template of A connecting to the edge. This is because if Blue tries to block A from the edge, Red will play B at some moment. Now A and B are connected through the virtual connection, and the rest of the strategy will connect either A or B to the edge, which means A is gauranteed to be connected to the edge.
 +
 +
=== Weak pivoting templates and capped flanks ===
 +
 +
Specifically, if we line up points A and B of any (weak) pivoting template with points A and J of a capped flank, we obtain a guaranteed connection to the edge. For example, consider the capped flank
 +
<hexboard size="4x4"
 +
  edges="none"
 +
  coords="none"
 +
  visible="-a1 a2 b1 d4"
 +
  contents="R A:a4 b2 c1 E J:c4"
 +
  />
 +
Attaching this on top of one of the above (weak) pivoting templates, we get the following:
 +
<hexboard size="8x8"
 +
  edges="bottom"
 +
  coords="none"
 +
  visible="area(d4,b6,a8,g8,g4,h3,h1,g1)"
 +
  contents="R A:e4 f2 g1 S area(d4,b6,a8,g8,g4)-f4 E B:g4"
 +
  />
 +
This guarantees that Red can connect A to the edge. These pre-templates make up a subset of a larger group of [https://www.hexwiki.net/index.php/Flank#Edge_templates_from_capped_flanks edge templates formed with capped flanks].
  
 
== Pivoting ladder creation templates ==
 
== Pivoting ladder creation templates ==

Latest revision as of 02:51, 27 June 2026

A pivoting template is a kind of edge template that guarantees that the template's owner can either connect the template's stone(s) to the edge, or else can occupy a specified empty hex and connect it to the edge.

More precisely, a pivoting template is a pattern that has a stone A and an empty hex B, such that the template's owner can continuously threaten to connect A to the edge until the point where the template's owner either connects A to the edge or occupies B and connects B to the edge. To be considered a "template", its carrier should moreover be minimal with this property.

Example

The following is a pivoting template.

AB

Proof: Red's main threat is to bridge to c and connect to the edge by ziggurat or edge template III1b. Therefore, to prevent Red from connecting to the edge outright, Blue must play in one of the cells a,...,g.

ABabcdefg

If Blue plays at a, Red responds at b and connects outright by edge template IV1a.

If Blue plays at b, Red responds with a 3rd row ladder escape fork:

A82147635

If Blue plays at c, d, or f, Red responds as follows and is connected by edge template V2f. If Blue plays on the right instead of 3, Red responds as if defending template V2f.

A431211

If Blue plays at e or g, Red responds at c and gets a 2nd or 3rd row ladder, which can reach B by ladder escape fork.

List of pivoting templates

2nd row

AB

3rd row

AB
AB

4th row

AB
AB
AB

5th row

AB
AB
BA
BA

6th row

AB
AB
AB
AB
AB
AB
AB
AB

Weak pivoting templates

There is another notion similar to a pivoting template, but slightly weaker. In a weak pivoting template, we merely require that the template's owner can guarantee to either connect A to the edge or occupy B and connect B to the edge, but we drop the requirement that the owner can "continuously threaten to connect A to the edge until" that point. Typically this means that after the player occupies B, the opponent can still choose whether to let the player connect A or B to the edge.

The following are examples of weak pivoting templates:

AB
AB

Weak pivoting templates are sufficient to form a connection when combined with a flank. However, there are some contexts where a proper pivoting template would connect, but a weak pivoting template does not. The following is an example of this:

abcdefghi123456789

The highlighted area is a weak pivoting template, but with Blue to move, the position is losing for Red. On the other hand, if we use a proper pivoting template in the analogous situation, the position is winning for Red:

abcdefghi123456789

Weak pivoting templates with an extra semi-connection

Suppose apart from the (weak) pivoting template, there is an extra semi-connection between A and B that does not overlap with the template, then the following holds when taking the semi-connection into consideration.

Connecting B with sente

If Blue decides to block Red from connecting A, then Red not only gets to connect B, but also gets a sente. This is because once the connection from Red B to the edge is ensured, Blue will have to spend a move blocking B from connecting back to A through the semi-connection.

Deriving pre-templates

Placing a red stone at B results into a pre-template connecting A to the edge. This is because, by definition, if Blue tries to block A from the edge, Red will play B at some moment from the strategy of the original (weak) pivoting template. However, if Red already has a stone at B, they can spend that move connecting B back to A through the semi-connection, and the rest of the strategy will connect either A or B to the edge, which means A is gauranteed to be connected to the edge.

It is not true that the pre-template is always a template. For example, if we consider the following pivoting template with a red stone at B and with an extra cell at *, then the result is not a template; the cells with + can be removed.

AB

Weak pivoting templates with an extra virtual connection

Suppose apart from the (weak) pivoting template, there is an extra virtual connection between A and B that does not overlap with the template, then they form a pre-template of A connecting to the edge. This is because if Blue tries to block A from the edge, Red will play B at some moment. Now A and B are connected through the virtual connection, and the rest of the strategy will connect either A or B to the edge, which means A is gauranteed to be connected to the edge.

Weak pivoting templates and capped flanks

Specifically, if we line up points A and B of any (weak) pivoting template with points A and J of a capped flank, we obtain a guaranteed connection to the edge. For example, consider the capped flank

AJ

Attaching this on top of one of the above (weak) pivoting templates, we get the following:

AB

This guarantees that Red can connect A to the edge. These pre-templates make up a subset of a larger group of edge templates formed with capped flanks.

Pivoting ladder creation templates

Sometimes, the pivoting property can be combined with other properties of templates. For example, a ladder creation template guarantees that Red can get at least a specified ladder. A pivoting ladder creation template is a template with a red stone A and an empty hex B, such that Red can continuously threaten to get a ladder from A, until the point where Red either gets the ladder or occupies and connects B to a ladder. When combined with an appropriate ladder escape, a pivoting ladder creation template becomes a pivoting template.

For example, the following is a pivoting 3rd-row-ladder creation template.

AB

The only way for Blue to prevent A from connecting outright or getting the ladder is to play at 1. In this case, Red responds as follows:

A621543

See also