Search results

Jump to: navigation, search

Page title matches

  • ...d and blue pieces, the winner remains the same when the colour of the dead cell is changed from red to blue or vice versa. A cell that is not dead is ''alive''.
    5 KB (925 words) - 16:30, 25 May 2023
  • ...ured'' by a player if all of the opponent's pieces in that area are [[dead cell|dead]], and for any possible move by the opponent in the area, the player h ...d cells are captured by Red. If Blue plays at a, Red can play at b, [[dead cell|killing]] a.
    10 KB (1,893 words) - 23:42, 14 February 2024
  • 24 B (2 words) - 21:19, 16 November 2023

Page text matches

  • ...d in a red cell is probably winning and should be swapped; those in a blue cell are probably losing and should not be swapped; and those marked "*", which
    9 KB (1,588 words) - 14:53, 18 November 2023
  • The shaded cell is not part of the template and can be occupied by Blue. The shaded cell is not part of the template and can be occupied by Blue.
    3 KB (562 words) - 02:57, 2 May 2024
  • The important point is that the piece in a useless triangle is [[dead cell|dead]]. It has effectively been removed from the game — that is, it canno ...eless triangle is a special case of the more general concept of [[captured cell|capture]].
    1 KB (230 words) - 01:47, 12 September 2021
  • In other words, c [[dominated cell|dominates]] a and b.
    6 KB (1,139 words) - 15:33, 7 October 2023
  • ...ther templates, the 2nd row edge template [[captured cell|captures]] every cell in its carrier. It therefore offers no useful [[intrusion]] points to the o
    458 B (74 words) - 19:17, 28 December 2020
  • ...verlapping'''; each of the three threatened connections passes through the cell c3. Therefore, by moving at c3, Blue can neutralize all three threats at th
    3 KB (451 words) - 01:49, 18 May 2022
  • ...in the other cell, which not only reconnects the template but also [[dead cell|kills]] the opponent's piece. * Red e2 [[captured cell|captures]] d3 and e3 and [[dead cell|kills]] c1: <hexboard size="3x6"
    5 KB (895 words) - 02:18, 5 October 2023
  • ...can [[jumping|jump]] ahead to the escape template by playing at the marked cell.
    2 KB (433 words) - 21:12, 28 December 2020
  • ...hey had blue pieces in them. This makes the red pieces at a1 and b1 [[dead cell|dead]]. Therefore, after Blue's move at b2, the position is strategically e
    4 KB (667 words) - 16:28, 25 May 2023
  • A wall can contain one-cell holes without affecting its function, as long as the whole wall is a single
    1 KB (269 words) - 22:32, 19 May 2022
  • ...up or template. For example, if the opponent places a stone in a key empty cell that is necessary for a player's group to maintain its connection, the play
    1 KB (255 words) - 02:46, 23 January 2023
  • ...ge if a straight line of diagonal [[bridge]] jumps can be made between the cell and the edge: A cell is '''doubly reachable''' if diagonals can be made in both directions:
    741 B (132 words) - 14:16, 9 December 2020
  • ...enerally, it is still unknown whether one stone edge templates that use no cell higher than the initial stone can be found for all heights. Such [[edge tem
    2 KB (369 words) - 21:45, 28 December 2020
  • * [[Captured cell]]s * [[Dead cell]]s
    3 KB (429 words) - 00:43, 8 May 2023
  • Two templates '''overlap''' if some empty cell belongs to both of their carriers. Care must be taken with overlapping temp
    3 KB (494 words) - 20:01, 19 February 2024
  • However it does not secure Red a connection, because there is one vulnerable cell, namely e7: * A ladder escape fork on the third row is unfoilable if the cell marked "*" is empty, and is not required for the "connection up":
    6 KB (1,124 words) - 02:36, 8 January 2023
  • if Red does, then Red should play *, because this [[captured cell|captures]] the rest of the carrier.
    2 KB (391 words) - 00:46, 8 January 2023
  • ...all red cells that are connected to Red's top edge. If this set contains a cell on Red's bottom edge, then Red is the winner. Otherwise, Blue has a winning ...enever Red plays in a numbered cell, Blue responds by playing in the other cell of the same number. After filling all of the cells in this way, Red cannot
    10 KB (1,737 words) - 02:19, 26 April 2024
  • ...there is an ''n'' such that for any [[Board]] of size at least ''n'' that cell is a losing [[opening|opening move]]?
    4 KB (645 words) - 02:14, 9 November 2023
  • ...]] there ''other than'' at ''*'', then Blue responding at ''*'' [[Captured cell|captures]] those 6 cells. If Red [[Intrusion|intrudes]] at ''*'' ''before' ...respond to c3 with d3. In each case, Blue will have d2 and d4 [[Captured cell|captured]] to the right edge, so Red must defend against c1. If Red does s
    34 KB (6,464 words) - 23:41, 14 February 2024

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