Search results

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

• Ladder
  ...he first formation is called the [[bottleneck]]. In all cases, it is Red's turn.
  5 KB (891 words) - 14:12, 20 January 2023
• Swap rule
  ...lours: Red becomes Blue and Blue becomes Red. After the swap, it is Blue's turn. ...ch colours: Red stays Red and Blue stays Blue. After the swap, it is Red's turn.
  9 KB (1,588 words) - 14:53, 18 November 2023
• Weakest link
  ...ink in [[Blue]]'s best connection across the board. Thus, the player whose turn it is to move would be wise to play at f6. In fact, whoever plays next has
  690 B (126 words) - 00:11, 17 January 2023
• Basic (strategy guide)
  A [[Move|turn]] in Hex consists of placing a [[piece]] of your [[color]] on a hexagon. Th ...nding with his turn or swapping sides taking the initial play as his first turn.
  15 KB (2,693 words) - 23:24, 12 October 2022
• Forcing move
  ...a move that makes a threat that your opponent must reply to on their next turn. Common forcing moves include playing in one of the empty hexes of a [[brid ...e of forcing moves. She plays at e8, threatening to play at e7 on her next turn which would create a winning connection. Blue has little choice but to stop
  6 KB (1,139 words) - 15:33, 7 October 2023
• Intermediate (strategy guide)
  ...re moves that make a threat that your opponent must reply to on their next turn. Common forcing moves include playing in one of the [[Empty hex|open hexes] ...ple of forcing moves. He plays at e8 threatening to play at e7 on his next turn which would create an unbeatable winning chain. Blue has little choice but
  26 KB (4,694 words) - 01:56, 18 May 2022
• Sixth row template problem
  ...that the game on the board of width ''m'' designed as follows, with Blue's turn to play, is won by Red?
  2 KB (369 words) - 21:45, 28 December 2020
• Tom's move
  ...der. For a typical example, consider the following situation. It is Blue's turn, and Red wants to connect her stone to the bottom edge.
  10 KB (1,985 words) - 21:44, 20 April 2024
• Template
  ...as a whole. The simplest example is the following situation, called a ''U-turn'':
  3 KB (494 words) - 20:01, 19 February 2024
• Threat
  ...reat'' is a [[virtual connection]] that a player (usually the player whose turn it is not) can create in a single move. ...n Blue's edges (via a [[bridge]] and [[edge template II]]). If it is Red's turn, Red must try to prevent this connection. Red can do so, for example, by pl
  2 KB (279 words) - 01:59, 18 May 2022
• Wheel
  ==U-turn== The wheel should never be confused with the ''U-turn'', shown here:
  3 KB (482 words) - 17:33, 18 April 2023
• Open problems
  ...ntains a winning move. Otherwise any move is winning, even [[passing]] the turn. (This problem was posed by [[Jory]] in the [http://www.littlegolem.net/jsp
  4 KB (645 words) - 02:14, 9 November 2023
• Little Golem
  '''Little Golem''', often abreviated '''LG''', is a [[turn-based]] server maintained by [[Richard Malaschitz]] from [[Wikipedia:Slovak
  5 KB (690 words) - 21:31, 8 March 2023
• Advanced (strategy guide)
  The game is over. The f4-f5 pair is connected to d5 which in turn threatens to connect to left in two non-overlapping ways, c5 (a 3rd row tem
  31 KB (5,861 words) - 00:58, 9 February 2022
• Puzzles
  ...ardest puzzles from such positions. ​ For each of them, the player whose turn it is has exactly 1 winning move.
  5 KB (1,001 words) - 12:23, 5 January 2024
• Solutions to puzzles
  ...ll|capturing]] b1 and c1. Blue gets one more move before it becomes Red's turn again, and Blue's two moves can't be Blue occupying ''both'' c4 and a5. .... Red responds at b4, and Blue gets one more move before it becomes Red's turn again.
  34 KB (6,464 words) - 23:41, 14 February 2024
• Links
  * https://boardgamearena.com/ — BoardGameArena, a real-time and turn-based server. * http://www.littlegolem.net — [[Little Golem]], one of the best turn-based servers on the net. On Little Golem one may find many strong players,
  5 KB (735 words) - 23:20, 2 December 2023
• Online playing
  ...''real-time'', where moves are made within minutes (or even seconds), or ''turn-based'', where a player has days for one move. * [[Board Game Arena]] supports real-time as well as turn-based play
  2 KB (320 words) - 03:52, 15 March 2024
• Variants using the same equipment
  ...on the first turn, and subsequently, each player places two stones on each turn. The idea is to mitigate the first-player advantage by making the very firs == Random-turn Hex ==
  7 KB (1,237 words) - 17:18, 7 May 2023
• Twixt
  ...ke turns placing pegs of their respective colors on the board, one peg per turn.
  2 KB (306 words) - 18:31, 27 November 2007
• Smart Game Format
  ...occupied cell. A setup node usually also has a PL property to define whose turn it is. Example: <code>AB[e7][e8][e9]AW[a6][b6]AE[f8][g6][g7]PL[B]</code>. ...to set the color of the cursor, or to tell the user of a Hex puzzle whose turn it is.
  16 KB (2,720 words) - 14:16, 8 January 2023
• Winning strategy
  ...his case, we must specify not just the pieces on the board, but also whose turn it is. For example, we can say "Red has a winning strategy for this positio ...actly one of the players (the player whose turn it is, or the player whose turn it is not) has a winning strategy. (But it may not always be easy to figure
  5 KB (901 words) - 01:06, 12 September 2021
• Ladder puzzle 1/Solution
  ...row stone is. If h5 is further to the right, the 2nd row ladder will just turn into a 4th row ladder going the opposite way, eventually connecting with d5
  4 KB (732 words) - 03:43, 16 June 2021
• Why did you start playing Hex
  * Did it turn out to be anything like you expected it to? * Did it turn out to be anything like you expected it to?
  3 KB (562 words) - 18:20, 30 December 2022
• AND and OR rules
  ...nnection is a connection that Red can guarantee if Red goes first. Red can turn any semi-connection into a virtual connection by placing one more stone in
  8 KB (1,312 words) - 19:01, 7 October 2023
• Dead cell
  ...lso never advantageous to move in a cell that the opponent can kill (i.e., turn into a dead cell) with the next move. Such a cell is called ''vulnerable''
  5 KB (925 words) - 16:30, 25 May 2023
• Havannah
  On Black's turn, he or she places a black piece on an empty cell; White does the same with
  2 KB (392 words) - 04:31, 12 July 2021
• Bridg-It
  In each turn, a player draws either a horizontal or a vertical line. Red's lines don't e ...alternate. On Red's turn, Red colors one of the grey edges red. On Blue's turn, Blue erases one of the grey edges. Red wins if there is a red path connect
  6 KB (1,060 words) - 04:11, 30 May 2023
• Bill LeBoeuf vs. Universidad de Oviedo
  * Note: [[Turn-based]] game
  10 KB (1,993 words) - 14:36, 11 May 2023
• Mustplay region
  ...he possible ways in which Red could make a connection if it were ''Red's'' turn. These are called Red's ''[[threat]]s''. Red has (at least) the following
  14 KB (2,723 words) - 01:16, 4 October 2023
• New board diagrams
  ...e of the page. Text will flow around it. The value "inline" can be used to turn the diagram into an inline element, where it can appear in the middle of te
  10 KB (1,738 words) - 04:24, 5 February 2023
• Jonathan Rydh's strategy guide
  ...and reconnects after your weak block, you may have gained enough ground to turn the game to your favor.
  14 KB (2,557 words) - 20:29, 11 September 2021
• Piece
  ...site one player has red pieces and the other blue. The players take it in turn to put their pieces onto vacant [[hex]]es, with the goal of trying to creat
  911 B (183 words) - 21:31, 28 December 2020
• Theory of ladder escapes
  ...play one of these or he will lose instantly. We analyze all three moves in turn. ..., a 2nd-to-4th row [[switchback]] is a pattern that allows the attacker to turn around a 2nd row ladder into a ladder on the 4th row in the opposite direct
  123 KB (22,870 words) - 19:37, 2 April 2024
• Conventions
  ...state remains unchanged, and immediately after the swap, it is player 1's turn to play a white piece. ...g4 with a white piece at d7. Immediately after the swap, it is player 1's turn to play a black piece.
  11 KB (1,867 words) - 17:44, 4 February 2024
• Domination
  Here are such positions. In each position, it is Red's turn, and the only winning move is indicated by the letter e, h, or j:
  21 KB (3,995 words) - 22:37, 18 November 2023
• Optimal play
  ...rrangement of pieces on the Hex board, together with the information whose turn it is.
  3 KB (470 words) - 23:15, 28 August 2022
• Passing
  ...a move when it is one's turn to do so. It then becomes the other player's turn again. ...refore Q was winning for Red. Second, consider the case where it is Blue's turn. We have assumed that Red has a second-player winning strategory for P, and
  8 KB (1,507 words) - 21:23, 5 November 2021
• Flank
  ...validity of the constructed templates, not their minimality. They often do turn out to be minimal as well, but we do not claim that this is true in general
  17 KB (3,144 words) - 05:31, 1 December 2022
• Bridge ladder
  ...nues to the end, Blue connects. Red can't create a bottleneck, but Red can turn the ladder around, for example like this, resulting in a 2nd row ladder for
  7 KB (1,253 words) - 03:30, 11 September 2021
• Board Game Arena
  ...-time Hex. (The other most popular Hex site, [[Little Golem]], only offers turn-based play). * Turn-based play, ranging from one move per 2 days (slowest option) to 24 moves p
  4 KB (629 words) - 04:08, 20 December 2023
• Reverse Hex
  .... (b) Exactly one empty cell is left. This cannot happen since it is Red's turn and therefore there is an even number of empty cells on the board. (c) Ther
  11 KB (1,957 words) - 15:22, 10 July 2022
• Corner move
  ...or D. Generally, all moves on the [[short diagonal]] are good, but C and D turn out to offer the best compromise between connecting to the near edge, block
  4 KB (832 words) - 18:36, 24 February 2022
• Openings on 11 x 11
  ...se c2 [[Dominated_cell#Capture-domination|capture-dominates]] b2, which in turn capture-dominates a2. However, many strong players seem to think even c2 is
  11 KB (2,022 words) - 14:15, 22 October 2022
• Question
  == Example: U-turn == ...of a question is playing in the center of a [[wheel#U-turn|U-turn]]. The U-turn is the following position, consisting of two [[Multiple_threat#Overlapping_
  6 KB (1,073 words) - 16:05, 27 November 2022
• Openings on 19 x 19
  ...h this move, but it allows Blue to connect to the left on move 3, which in turn is very powerful because of the forcing sequence (moves 4-14) that allows B
  31 KB (5,546 words) - 14:54, 18 November 2023
• Solutions to worst move puzzles
  ...lso be losing for Red. We may therefore start by asking: if it were Blue's turn in the puzzle, then how could Blue win? Once a Blue connection has been ide
  4 KB (808 words) - 03:31, 7 October 2023