Multiple threat - Revision history

Selinger: Expanded multiple threats.

2022-05-18T01:49:56Z

Expanded multiple threats.

Tompo1: /* Overlapping threats */ typo

2021-02-19T17:42:57Z

‎Overlapping threats: typo

Selinger: Edited categories

2020-12-28T19:06:42Z

Edited categories

Selinger: Converted to new hexboard diagrams

2020-12-09T14:22:51Z

Converted to new hexboard diagrams

Selinger: Fixed diagram syntax.

2020-09-08T16:59:11Z

Fixed diagram syntax.

Selinger: Fleshed out the stub.

2020-08-17T20:21:19Z

Fleshed out the stub.

Halladba: cat. basic + stub + inner link

2008-12-02T23:53:29Z

cat. basic + stub + inner link

Halladba: merging with multiple threats.

2007-12-12T11:54:26Z

merging with multiple threats.

Gregorio at 13:06, 27 November 2007

2007-11-27T13:06:42Z

Halladba: corrected an inner link

2007-11-27T00:50:33Z

corrected an inner link

@@ 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.
 == 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"
    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.
 == Overlapping threats ==
@@ Line 30: / Line 61: @@
    />
-== Ladder escape forks ==
+== See also ==
-A [[ladder escape fork]] is a typical example of a multiple threat.
+* [[Double threat]]
 [[category:Basic Strategy]]
 [[category:Definition]]

@@ Line 23: / Line 23: @@
    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"
    coords="none"

← Older revision		Revision as of 19:06, 28 December 2020
Line 35:		Line 35:

	[[category:Basic Strategy]]		[[category:Basic Strategy]]
		+	[[category:Definition]]
	{{stub}}		{{stub}}

@@ Line 9: / Line 9: @@
 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 "*".
 <hexboard size="4x5"
-   coords="hide"
+   coords="none"
    contents="R a3 b2 c4 d3 e2 B c3 E *:b4 *:d1"
    />
@@ Line 18: / Line 19: @@
 In the following situation, Red can connect the two groups by moving at any one of the cells marked "*".
 <hexboard size="4x5"
    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.
 <hexboard size="4x5"
    contents="R d1 b4 c4 B b2 e2 B c3"
    />

@@ Line 10: / Line 10: @@
 <hexboard size="4x5"
    coords="hide"
-   contents="R a3 b2 c4 d3 e2 B c3 E *:b4 d1"
+   contents="R a3 b2 c4 d3 e2 B c3 E *:b4 *:d1"
    />
 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.
@@ Line 18: / Line 18: @@
 In the following situation, Red can connect the two groups by moving at any one of the cells marked "*".
 <hexboard size="4x5"
-   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.

@@ Line 1: / Line 1: @@
-Threatening to do two different attacks with one move. Often the opponent will only be able to defend against one of the attacks, or defend only partially against both.
+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 or [[threat]]s. Moves that contain only a single threat are generally not hard to meet. If a move contains '''multiple threats''', the opponent may not be able to stop all the threats with a single move.
+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.
-A [[Ladder escape|Ladder Escape]] is a typical multiple threat.
+It is sometimes called fork in Hex and other games, and called [[miai]] in go.
-It is sometimes called fork in hex and other games, and called [[miai]] in go.
+== Connection by double threat ==
 [[category:Basic Strategy]]
 {{stub}}

← Older revision		Revision as of 23:53, 2 December 2008
Line 5:		Line 5:
	A [[Ladder escape\|Ladder Escape]] is a typical multiple threat.		A [[Ladder escape\|Ladder Escape]] is a typical multiple threat.

−	It is sometimes called fork in hex and other games, and called miai in go.	+	It is sometimes called fork in hex and other games, and called [[miai]] in go.
		+
		+	[[category:Basic Strategy]]
		+	{{stub}}

← Older revision		Revision as of 11:54, 12 December 2007
Line 1:		Line 1:
		+	Threatening to do two different attacks with one move. Often the opponent will only be able to defend against one of the attacks, or defend only partially against both.
		+
	Whenever possible, a player should make each move achieve at least two different goals or [[threat]]s. Moves that contain only a single threat are generally not hard to meet. If a move contains '''multiple threats''', the opponent may not be able to stop all the threats with a single move.		Whenever possible, a player should make each move achieve at least two different goals or [[threat]]s. Moves that contain only a single threat are generally not hard to meet. If a move contains '''multiple threats''', the opponent may not be able to stop all the threats with a single move.

← Older revision		Revision as of 13:06, 27 November 2007
Line 2:		Line 2:

	A [[Ladder escape\|Ladder Escape]] is a typical multiple threat.		A [[Ladder escape\|Ladder Escape]] is a typical multiple threat.
		+
		+	It is sometimes called fork in hex and other games, and called miai in go.

← Older revision		Revision as of 00:50, 27 November 2007
Line 1:		Line 1:
	Whenever possible, a player should make each move achieve at least two different goals or [[threat]]s. Moves that contain only a single threat are generally not hard to meet. If a move contains '''multiple threats''', the opponent may not be able to stop all the threats with a single move.		Whenever possible, a player should make each move achieve at least two different goals or [[threat]]s. Moves that contain only a single threat are generally not hard to meet. If a move contains '''multiple threats''', the opponent may not be able to stop all the threats with a single move.

−	A [[Ladder Escape]] is a typical multiple threat.	+	A [[Ladder escape\|Ladder Escape]] is a typical multiple threat.