Search results

Jump to: navigation, search
  • ...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
  • ...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
  • ...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
  • * 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
  • ...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
  • ...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
  • 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
  • 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
  • * Note: [[Turn-based]] game
    10 KB (1,993 words) - 14:36, 11 May 2023
  • ...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
  • ...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
  • ...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
  • ...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
  • ...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
  • ...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
  • 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
  • ...rrangement of pieces on the Hex board, together with the information whose turn it is.
    3 KB (470 words) - 23:15, 28 August 2022
  • ...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
  • ...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
  • ...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
  • ...-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
  • .... (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
  • ...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) - 21:01, 1 May 2024
  • ...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
  • == 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
  • ...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
  • ...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
  • ...very way of embedding the region inside a larger game, and no matter whose turn it is, if P is winning for Red, then Q is also winning for Red. ...s the same game, but with position Q in the region. It is the same color's turn on both boards. Red's goal is to win against Blue on the right board. The l
    23 KB (4,007 words) - 00:18, 12 May 2024
  • ...sizes from 1x1 to 42x42, and flexible time controls for both real-time and turn-based play. It also provides AI opponents of various strengths, including a
    1 KB (189 words) - 18:17, 20 May 2024

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)