Search results

Create the page "Adjacent move" on this wiki! See also the search results found.

• Basic (strategy guide)
  A [[Move|turn]] in Hex consists of placing a [[piece]] of your [[color]] on a hexago ...and start with an advantage. If the first player makes a very weak opening move, the second player won't swap and again will start with an advantage.
  15 KB (2,693 words) - 23:24, 12 October 2022
• Forcing move
  ...rong connection]] or [[win]]. Consider the following position with Red to move. ...by playing e7, since there are no better options. The move e8 is a forcing move.
  6 KB (1,139 words) - 15:33, 7 October 2023
• Climbing
  '''Climbing''' means playing a series of [[forcing move]]s by which a player gains significant distance across the board and potent Here is an idealized example. Red to move.
  14 KB (2,655 words) - 12:53, 27 April 2024
• Territory
  ...[[Hex (board element)|hexes]] occupied by the player, plus any empty hexes adjacent to them. Consider the following situation, with Red to move.
  1 KB (218 words) - 22:20, 21 December 2023
• Intermediate (strategy guide)
  ...nnection''' — a [[Hex (board element)|hex]] that is a bridge plus an adjacent step away. ...ce]]s of the loose connection [[threat]]en to connect via a bridge plus an adjacent step [[double threats|in two different ways]] — by playing at either
  26 KB (4,694 words) - 01:56, 18 May 2022
• Edge template
  ...connect their piece marked "↑" to the bottom edge, even if it is Blue's move. Here is an example of an attempt to block Red's connection by Blue, plus R * [[Edge templates with two adjacent stones]]
  4 KB (666 words) - 01:55, 12 June 2021
• Liberty
  ...or a [[group]] is the number of unoccupied [[Hex (board element)|cells]] [[adjacent]] to it. A piece with few liberties is generally weaker than one with many ...solated piece with three or fewer liberties.'' Such a move is always a bad move — it is always possible to find a better one.
  386 B (66 words) - 15:07, 17 November 2012
• Opening
  * Where should the first move be played? === The first move ===
  2 KB (325 words) - 18:04, 19 March 2023
• Ladder handling
  ...n example where Red is the attacker and Blue is the defender, with Blue to move. * '''Pushing''' means to play a move on the same row as the earlier moves.
  4 KB (771 words) - 01:43, 7 May 2023
• Unlur
  ...objective of the game is to create either a [[chain]] connecting three non-adjacent sides (a "Y") or a chain connecting two opposite sides (a "line"). ...ng a line, Black wins. If a player creates both a line and a Y in the same move, they win.
  1 KB (259 words) - 03:28, 5 February 2023
• Advanced (strategy guide)
  ...rudes in the template at any hex besides the three marked '+', Red makes a move that reduces the situation to a closer template. Furthermore, the large perimeter makes it more vulnerable to encroaching adjacent plays and forcing moves. Additionally, template area surrounds the 5th row
  31 KB (5,861 words) - 00:58, 9 February 2022
• Equivalent patterns
  ...ard is equivalent to the same position on the interior (i.e. the cells non-adjacent to the edges) of an <em>(n+2)x(m+2)</em> board with the first rows next to ...G, let the '''neighborhood''' of G, neigh(G), be the set of cells that are adjacent to G but do not belong to it. In a given pattern P₁, suppose tha
  13 KB (2,546 words) - 02:17, 9 May 2023
• Y
  ...here are two [[Player (general)|players]], who have one colour each, and a move consists of placing a piece of your colour in one of the hexagons on the bo ...as regions themselves, this gives a map of five regions, each of which is adjacent to the other four. However, this is impossible, as the graph K5 is non-plan
  6 KB (1,030 words) - 22:25, 28 December 2020
• Edge template V1a
  This template often appears as a third move, for instance in the [[a3 opening]], because the played piece is guaranteed Furthermore, the large perimeter makes it more vulnerable to encroaching adjacent plays and forcing moves. Additionally, the [[carrier]] surrounds the 5th ro
  5 KB (953 words) - 13:44, 27 August 2022
• Coordinates
  ...s two adjacent cells are b1 and a2. It is assumed that the first player to move is vertical, i.e., must connect rows 1 and ''n'' on an ''n''&times;''n'' bo
  1 KB (251 words) - 02:46, 30 May 2023
• Solutions to Piet Hein's puzzles
  Using twice [[Edge templates with two adjacent pieces|edge template III 2b]] The unique opening move for which the board will be completely filled is Red a2 (or equivalently on
  3 KB (640 words) - 14:34, 11 May 2023
• New board diagrams
  The cells on a line do not need to be adjacent, for example: As another example, here is the area required by [[Tom's move]]:
  10 KB (1,738 words) - 04:24, 5 February 2023
• Jonathan Rydh's strategy guide
  ...nnection there is. It can not be tampered with in any way. Stones that are adjacent to each other form solid connections. In some cases certain bridges or othe ...'' cannot be broken if the opponent doesn't allow it. He can counter every move you make so that he maintains his strong connection. A strong connection is
  14 KB (2,557 words) - 20:29, 11 September 2021
• Open problems about edge templates
  ...s laddering along the 4th row and Blue suddenly decides to play elsewhere (move 1 in the position below). ...stone, the template is not suitable for connecting a 6th row stone placed adjacent to a 7th row ladder. Is Red's stone 1 connected to the bottom edge here?
  7 KB (1,215 words) - 02:29, 9 November 2023
• Conventions
  ...n advantages. For example, every chess player understands what it means to move a white pawn from d2 to d4, without requiring further explanation. In particular, this means that the three cells A1, B1, and A2 are all adjacent to each other.
  11 KB (1,867 words) - 17:44, 4 February 2024
• Domination
  In game theory, a move ''dominates'' another move if it is at least as good. In Hex, we say that a cell X dominates another c ...whole board. In particular, it is often possible to figure out whether one move dominates another without actually knowing whether either of these moves is
  21 KB (3,995 words) - 22:37, 18 November 2023
• Resigning
  ...rinciple, a game of Hex ends when one player achieves a solid [[chain]] of adjacent pieces connecting their two edges. In practice, the game usually ends when ...are losing, when in fact they could have won but failed to see the winning move. This is also frustrating for the opponent, who probably had a cunning plan
  3 KB (581 words) - 21:41, 28 December 2020
• Tom's move for 3rd and 5th row parallel ladders
  There is a version of [[Tom's move]] that works for [[parallel ladder]]s on the 3rd and 5th rows. It requires ...es#V-2-m|edge template V2m]]. The latter template is itself based on Tom's move at "x". It works, for example, like this:
  11 KB (2,210 words) - 00:56, 27 July 2022
• Flank
  A '''flank''' is a sequence of [[friendly]] [[stone]]s that are either adjacent or linked by [[bridge]]s in a certain way, and with a certain amount of spa The following example is from an actual game. Blue to move and win.
  17 KB (3,144 words) - 05:31, 1 December 2022
• Theorems about templates
  Many templates with two adjacent stones have crescented versions. Indeed, the crescent itself is such a temp Some templates, such as [[Tom's move]], have an "alternative connection up". There is a general theorem about th
  29 KB (4,992 words) - 05:51, 21 April 2024
• Openings on 19 x 19
  * While [[corner move|corner moves]] are still good moves, playing near the middle of your oppone ...ow ladder. Instead of continuing to defend the ladder, Blue jumps ahead on move 9, gaining a useful stone that could combine well with Blue 1 via (*).
  31 KB (5,546 words) - 14:54, 18 November 2023
• Strategic advice from KataHex
  ...your own edge a good idea? There are a few cases, like when you're playing adjacent to existing stones, responding to a joseki, or pushing a ladder as the atta ...their existing stone on the 5th or 6th row of their own edge. Playing two adjacent stones like this is not very efficient and typically a mistake.
  21 KB (3,605 words) - 16:08, 14 January 2024