Difference between revisions of "Multiple threat"

From HexWiki
Jump to: navigation, search
(Edited categories)
(Expanded multiple threats.)
 
(One intermediate revision by one other user not shown)
Line 2: Line 2:
  
 
Whenever possible, a player should make each move achieve at least two different goals. Moves that contain only a single threat are generally not hard to meet. Moves that contain multiple threats are more difficult, and sometimes impossible, to stop.  
 
Whenever possible, a player should make each move achieve at least two different goals. Moves that contain only a single threat are generally not hard to meet. Moves that contain multiple threats are more difficult, and sometimes impossible, to stop.  
 
It is sometimes called fork in Hex and other games, and called [[miai]] in go.
 
  
 
== Connection by double threat ==
 
== Connection by double threat ==
  
The most common example of a multiple treat is when two of a player's groups are connected to each other by a double threat. In the following position, Red's two groups are connected by double threat at the two cells marked "*".
+
The most common example of a multiple treat is a [[double threat]] connecting two of a player's [[group]]s. In the following position, Red's two groups are connected by double threat at the two cells marked "*".
 
<hexboard size="4x5"
 
<hexboard size="4x5"
 
   coords="none"
 
   coords="none"
Line 14: Line 12:
 
   />
 
   />
 
If Blue moves at one of the cells marked "*" or its neighbors, Red can respond at the other one, thus guaranteeing a connection between the two groups.
 
If Blue moves at one of the cells marked "*" or its neighbors, Red can respond at the other one, thus guaranteeing a connection between the two groups.
 +
 +
== Connection by triple threat ==
 +
 +
Consider [[edge template IV1a]].
 +
<hexboard size="4x7"
 +
  coords="none"
 +
  edges="bottom"
 +
  visible="area(e1,c2,a4,g4,g2,f1)"
 +
  contents="R e1 E a:d2 b:e2 c:f2"
 +
  />
 +
The red stone is connected to the edge by (at least) three threats at a, b, and c.
 +
If Red plays at a or c, Red is connected by a [[ziggurat]]:
 +
<hexboard size="4x7"
 +
  coords="none"
 +
  edges="bottom"
 +
  visible="area(e1,c2,a4,g4,g2,f1)"
 +
  contents="R e1 R a:d2 S area(c2,a4,d4,d2)"
 +
  />
 +
<hexboard size="4x7"
 +
  coords="none"
 +
  edges="bottom"
 +
  visible="area(e1,c2,a4,g4,g2,f1)"
 +
  contents="R e1 R c:f2 S area(f2,d4,g4,g2) f1 e2"
 +
  />
 +
If Red plays at b, Red is connected by [[edge template III1b]]:
 +
<hexboard size="4x7"
 +
  coords="none"
 +
  edges="bottom"
 +
  visible="area(e1,c2,a4,g4,g2,f1)"
 +
  contents="R e1 R b:e2 S area(d2,b4,f4,f2)-d4"
 +
  />
 +
Since there is no hex in the overlap of all three threats, Blue cannot block Red's connection.
 +
  
 
== Overlapping threats ==
 
== Overlapping threats ==
Line 23: Line 54:
 
   contents="R d1 b4 c4 B b2 e2 E *:c2 *:d2 *:c3"  
 
   contents="R d1 b4 c4 B b2 e2 E *:c2 *:d2 *:c3"  
 
   />
 
   />
However, these threats are '''overlapping'''; each of the three threatened connections passes through the cell c3. Therefore, by moving at c3, Blue can neutralize all three threats at the same time, denying Blue the connection.
+
However, these threats are '''overlapping'''; each of the three threatened connections passes through the cell c3. Therefore, by moving at c3, Blue can neutralize all three threats at the same time, denying Red the connection.
 
<hexboard size="4x5"
 
<hexboard size="4x5"
 
   coords="none"
 
   coords="none"
Line 30: Line 61:
 
   />
 
   />
  
== Ladder escape forks ==
+
== See also ==
  
A [[ladder escape fork]] is a typical example of a multiple threat.
+
* [[Double threat]]
 +
* [[Mustplay region]]
 +
* [[AND and OR rules]]
  
 
[[category:Basic Strategy]]
 
[[category:Basic Strategy]]
 
[[category:Definition]]
 
[[category:Definition]]
{{stub}}
 

Latest revision as of 01:49, 18 May 2022

A multiple threat is when a player threatens to connect in two or more different ways. Ideally, the opponent cannot defend against all of them simultaneously; or at least the presence of multiple threats severely constrains the opponent's options.

Whenever possible, a player should make each move achieve at least two different goals. Moves that contain only a single threat are generally not hard to meet. Moves that contain multiple threats are more difficult, and sometimes impossible, to stop.

Connection by double threat

The most common example of a multiple treat is a double threat connecting two of a player's groups. In the following position, Red's two groups are connected by double threat at the two cells marked "*".

If Blue moves at one of the cells marked "*" or its neighbors, Red can respond at the other one, thus guaranteeing a connection between the two groups.

Connection by triple threat

Consider edge template IV1a.

abc

The red stone is connected to the edge by (at least) three threats at a, b, and c. If Red plays at a or c, Red is connected by a ziggurat:

a
c

If Red plays at b, Red is connected by edge template III1b:

b

Since there is no hex in the overlap of all three threats, Blue cannot block Red's connection.


Overlapping threats

In the following situation, Red can connect the two groups by moving at any one of the cells marked "*".

However, these threats are overlapping; each of the three threatened connections passes through the cell c3. Therefore, by moving at c3, Blue can neutralize all three threats at the same time, denying Red the connection.

See also