Search results

Jump to: navigation, search
  • ...he first formation is called the [[bottleneck]]. In all cases, it is Red's turn.
    5 KB (891 words) - 14:12, 20 January 2023
  • ...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
  • ...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
  • 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
  • ...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
  • ...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
  • ...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
  • ...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
  • ...as a whole. The simplest example is the following situation, called a ''U-turn'':
    3 KB (494 words) - 20:01, 19 February 2024
  • ...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
  • ==U-turn== The wheel should never be confused with the ''U-turn'', shown here:
    3 KB (482 words) - 17:33, 18 April 2023
  • ...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''', often abreviated '''LG''', is a [[turn-based]] server maintained by [[Richard Malaschitz]] from [[Wikipedia:Slovak
    5 KB (690 words) - 21:31, 8 March 2023
  • 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
  • ...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
  • ...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
  • * 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
  • ...''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
  • ...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
  • ...ke turns placing pegs of their respective colors on the board, one peg per turn.
    2 KB (306 words) - 18:31, 27 November 2007

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