Search results

Jump to: navigation, search
  • ...other. This typically works because the opponent is inexperienced. (If the opponent were experienced, then either there shouldn't be handicap or the handicap s before trying to get the opponent to connect too strongly to the other side. (There are other things for Blu
    2 KB (372 words) - 03:58, 13 September 2021
  • ...ositions on the board, creating a narrow passage that is difficult for the opponent to break through. The board fragment shown below illustrates this concept, ...strategy, it also has its own weaknesses and can be exploited by a skilled opponent. Knowing how to both create and counter bottleneck formations is an importa
    1 KB (245 words) - 02:30, 10 May 2024
  • ...ar with particular openings. Playing an unfamiliar opening can confuse the opponent.
    9 KB (1,588 words) - 14:53, 18 November 2023
  • ...th a winner as it is impossible for one player to surround one edge of the opponent without connecting their own two edges. On the right you see an example of ...tegy of the game is to connect one's designated edges while preventing the opponent from doing the same. Detailed strategies can be found on the [[strategy]] p
    2 KB (313 words) - 14:01, 20 January 2023
  • : congratulations (to a winning opponent)
    795 B (120 words) - 23:26, 30 December 2007
  • ...h move you should attempt to either improve your weakest link or make your opponent's weakest link even weaker. A move which does both is a strong move.
    690 B (126 words) - 00:11, 17 January 2023
  • ...on only by playing a piece at either b3 or c2, and no matter which one the opponent plays, you can play the other and restore the link. For most purposes you c ...ontains some other [[threat]] that must be immediately answered. After the opponent answers the threat, you can then play in the other hex in the bridge breaki
    15 KB (2,693 words) - 23:24, 12 October 2022
  • ...ely equivalent. If you complete a connection between your sides, then your opponent is prevented from completing theirs. ...nt your opponent from making a connection and the only way to prevent your opponent from connecting is to complete your connection.
    1 KB (211 words) - 00:12, 17 January 2023
  • ...(board element)|hexes]] are occupied by the opponent's pieces (and/or the opponent's edge) in such a way that that piece has only two empty neighboring hexes
    1 KB (230 words) - 01:47, 12 September 2021
  • A '''forcing move''' is a move that makes a threat that your opponent must reply to on their next turn. Common forcing moves include playing in o In general terms, the opponent has three options when responding to a forcing move.
    6 KB (1,139 words) - 15:33, 7 October 2023
  • ...in its carrier. It therefore offers no useful [[intrusion]] points to the opponent.
    458 B (74 words) - 19:17, 28 December 2020
  • ...usly; or at least the presence of multiple threats severely constrains the opponent's options.
    3 KB (451 words) - 01:49, 18 May 2022
  • When the opponent intrudes into a template, it is often a good opportunity to look for a mini ...l, which not only reconnects the template but also [[dead cell|kills]] the opponent's piece.
    5 KB (895 words) - 02:18, 5 October 2023
  • ...adder]] by playing one hex ahead. This usually results in a ladder for the opponent. Example:
    4 KB (799 words) - 14:57, 18 November 2023
  • ...wift and unexpected defeat. It is therefore a good idea to try to deny the opponent opportunities to climb.
    14 KB (2,655 words) - 12:53, 27 April 2024
  • The idea is that when the opponent [[Intrusion|intrudes]] in the bridge by moving in one of the empty hexes be
    784 B (127 words) - 01:08, 19 July 2022
  • ...hole wall is a single [[group]]. The holes may be empty or occupied by the opponent.
    1 KB (269 words) - 22:32, 19 May 2022
  • Often a player can gain some useful territory by intruding into the opponent's templates.
    1 KB (218 words) - 22:20, 21 December 2023
  • When a piece's neighboring hexes are [[occupied hex|filled]] by the [[opponent]] such that that piece has only two empty neighboring hexes that are also [ ...l allow a piece to be [[Connection|connected]] to the [[edge]] even if the opponent has the next move. Just as the bridge is a useful connection pattern to kno
    26 KB (4,694 words) - 01:56, 18 May 2022
  • ...ent's [[intrusion]] into a player's group or template. For example, if the opponent places a stone in a key empty cell that is necessary for a player's group t ...outpost]]s that will be useful later, and for exploiting weaknesses in the opponent's position.
    1 KB (255 words) - 02:46, 23 January 2023

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