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 (418 words) - 01:44, 7 October 2023
  • 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
  • ...th the first rows next to each edge filled with friendly pieces and [[dead cell]]s at the vertex cells (or equivalently either red or blue pieces at any of Cells that are [[Captured cell|captured]] by one player can be filled in with stones of that player's colo
    13 KB (2,546 words) - 02:17, 9 May 2023
  • Size 7 was first solved by [[Ryan Hayward]] using [[dominated cell|domination]]. The proof tree can be found at http://www.cs.ualberta.ca/~hay ...Note this does '''not''' mean that the bot is at least 94.4% sure of each cell's outcome, only that it thinks it has a 94.4% win rate with the winning sid
    4 KB (639 words) - 14:54, 18 November 2023
  • ...pair. The player then plays as follows: whenever the opponent occupies one cell of a pair, the player occupies the other. In the bridge, there is only one pair, and if Blue plays in one cell, Red plays in the other.
    5 KB (918 words) - 00:52, 15 February 2022
  • ...tion, Black's optimal move is the same as White's optimal move, and is the cell most likely to change the outcome when the rest of the board is randomly fi
    7 KB (1,237 words) - 17:18, 7 May 2023
  • <P align=center>White cell: US player moved first<br> Grey cell: Polish player moved first<br>Result: US player\Polish player<BR><BR>
    19 KB (2,916 words) - 23:20, 31 January 2008
  • ...habet numbers, i.e., the next columns after 'z' are 'aa', 'ab', 'ac', etc. Cell names are case insensitive. Examples: <code>[a1]</code>, <code>[f6]</code>, ...iginal game. See [[conventions]] for more information on player colors and cell numbering.
    16 KB (2,720 words) - 14:16, 8 January 2023
  • * Placing a stone on an empty cell of the board.
    584 B (99 words) - 15:09, 17 November 2012
  • ...mustplay region]], computing [[captured cell]]s, and computing [[dominated cell|dominated moves]] can be used to reduce the number of moves that must be co
    1 KB (203 words) - 23:47, 25 January 2023
  • ...'E''ₙ is a semi-connection from ''x'' to ''y'', and if there is no empty cell that is common to all of their carriers, then their union forms a virtual c
    8 KB (1,312 words) - 19:01, 7 October 2023
  • Template III1-b is a 3rd row [[edge template]] with one stone. The shaded cell is not part of the template and can be occupied by Blue.
    830 B (141 words) - 05:32, 9 December 2020
  • ...n example of this is the [[useless triangle]]. If a player plays in a dead cell, the opponent does not have to respond, i.e., the situation is as if the pl ...ample of an irrelevant move is a move in a cell that is already [[captured cell|captured]] by the same player. Such moves can also be ignored by the oppone
    3 KB (503 words) - 23:36, 28 August 2022
  • ...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
  • ...ell|dead]] and [[dominated cell|dominated]] cells with the article '''Dead Cell Analysis in Hex and the Shannon Game'''.
    765 B (112 words) - 19:21, 28 December 2020
  • On Black's turn, he or she places a black piece on an empty cell; White does the same with a white piece. * a '''ring''': a connected chain that has at least one cell (empty or not) on its interior
    2 KB (392 words) - 04:31, 12 July 2021
  • ...e: another way to explain this is that g12 dominates h11. See [[dominated cell]]).</p>
    10 KB (1,993 words) - 14:36, 11 May 2023
  • ...n further, it helps to consider [[captured cell|captured]] and [[dominated cell|dominated]] cells. In the above example, d1, e1, e7, and f7 are captured b The only empty cell in the carrier of all three threats is b5, hence Blue's mustplay region con
    14 KB (2,723 words) - 01:16, 4 October 2023
  • A single piece at a3 (or at the equivalent cell on the opposite site of the board) escapes 2nd row ladders. It can also be ...n the first example above that a single Red piece at a4 (or the equivalent cell on the opposite side of the board) can be used as a 2nd-to-4th row switchba
    17 KB (3,207 words) - 22:47, 18 March 2024
  • * E (to mark a cell as empty) * S (to mark a cell as shaded &mdash; see [[#Shading]] below)
    10 KB (1,738 words) - 04:24, 5 February 2023
  • ...t presently support, including shading cells and showing partial boards. (Cell shading seems to be particularly desired; see e.g. [[Edge templates everybo
    4 KB (712 words) - 21:17, 28 December 2020
  • ...vious that Blue's virtual connection requires ''n'' stones, because if any cell is left empty, Red will win in one move.
    7 KB (974 words) - 14:39, 25 January 2023
  • The shaded cell is not part of the template and can be occupied by Blue.
    888 B (158 words) - 17:32, 10 December 2020
  • The shaded cell is not part of the template; it can be occupied by Blue. ...these. The leftmost stone is already connected to the bottom by [[captured cell|capture]] and Red can always maintain its connection.
    5 KB (865 words) - 02:47, 17 October 2023
  • The shaded cell is not part of the template and can be occupied by Blue.
    733 B (130 words) - 18:38, 11 December 2020
  • Template IV2-e is a 4th row [[edge template]] with 2 stones. The shaded cell is not part of the template and can be occupied by Blue.
    660 B (114 words) - 00:45, 12 December 2023
  • ...at least two of those three are still available. Also, since d3 [[captured cell|captures]] c4 and d4, the overlap between edge template IV2d and edge templ
    2 KB (355 words) - 16:49, 10 December 2020
  • The shaded cell is not part of the template and can be occupied by Blue.
    2 KB (319 words) - 06:50, 16 December 2020
  • ..."+" is no longer part of the pattern (i.e., it is not replaced by an empty cell). For example: ...by ''m'' cells to the left, then reducing the size of that boundary by one cell, and then shifting it by another ''n'' cells to the left. For example:
    123 KB (22,870 words) - 19:37, 2 April 2024
  • The shaded cell is not part of the template. It can be occupied by Blue. The shaded cell is not part of the template. It can be occupied by Blue.
    5 KB (920 words) - 02:06, 1 November 2023
  • ...*" is a peep. This is because in such cases, Red playing "*" would [[Dead cell|kill]] ''a''. Therefore, if Red just defends the [[bridge]], then Blue can' Blue d2 [[captured cell|captures]] the entire corner, turning the corner into this:
    8 KB (1,413 words) - 00:27, 16 August 2022
  • Red keeps a future option of playing in the cell marked with an asterisk.<br/> Red's plan is to get the cell marked with an asterisk for free in future, so she shouldn't play there imm
    10 KB (1,802 words) - 20:09, 9 March 2024

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