Search results

Create the page "Cell" on this wiki! See also the search results found.

Page title matches

• Dead cell
  ...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
• Captured cell
  ...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
• Dominated cell
  24 B (2 words) - 21:19, 16 November 2023

Page text matches

• Swap rule
  ...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
• Edge templates with one stone
  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
• Useless triangle
  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
• Forcing move
  In other words, c [[dominated cell|dominates]] a and b.
  6 KB (1,139 words) - 15:33, 7 October 2023
• Edge template II
  ...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
• Multiple threat
  ...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
• Minimaxing
  ...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
• Ladder escape template
  ...can [[jumping|jump]] ahead to the escape template by playing at the marked cell.
  2 KB (433 words) - 21:12, 28 December 2020
• A1 opening
  ...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
• Wall
  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
• Local play
  ...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
• Attack zone
  ...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
• Sixth row template problem
  ...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
• Strategy
  * [[Captured cell]]s * [[Dead cell]]s
  3 KB (429 words) - 00:43, 8 May 2023
• Template
  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
• Foiling
  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
• Trapezoid
  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
• Hex theory
  ...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
• Open problems
  ...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
• Solutions to puzzles
  ...]] 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
• Equivalent patterns
  ...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
• Small boards
  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
• Pairing strategy
  ...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
• Variants using the same equipment
  ...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
• Team Tournament 1
  <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
• Smart Game Format
  ...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
• Move
  * Placing a stone on an empty cell of the board.
  584 B (99 words) - 15:09, 17 November 2012
• Branching factor
  ...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
• AND and OR rules
  ...'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
• Edge template III1b
  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
• Irrelevant move
  ...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
• Dead cell
  ...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
• Ryan Hayward
  ...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
• Havannah
  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
• Bill LeBoeuf vs. Universidad de Oviedo
  ...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
• Mustplay region
  ...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
• Switchback
  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
• New board diagrams
  * 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
• The new HexWiki
  ...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
• Parallelogram boards
  ...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
• Edge template III2c
  The shaded cell is not part of the template and can be occupied by Blue.
  888 B (158 words) - 17:32, 10 December 2020
• Fourth row edge templates
  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
• Edge template IV2c
  The shaded cell is not part of the template and can be occupied by Blue.
  733 B (130 words) - 18:38, 11 December 2020
• Edge template IV2e
  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
• Edge template IV2l
  ...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
• Edge template IV3b
  The shaded cell is not part of the template and can be occupied by Blue.
  2 KB (319 words) - 06:50, 16 December 2020
• Theory of ladder escapes
  ..."+" 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
• Fifth row edge templates
  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
• Peep
  ...*" 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
• Joseki
  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
• Interior template
  ..."a" and "b", which belong to the carrier of this template, are [[captured cell|captured]] by Red, and therefore this really is an edge version of the long ...tually necessary to have a solid row of stones; it is sufficient that each cell on "row 1" of the edge is adjacent to a connected red stone. For example, t
  6 KB (1,035 words) - 23:41, 14 February 2024
• GTP
  | A cell such as 'a7' or 'c4', or one of the special moves 'resign' or 'swap-pieces'
  6 KB (848 words) - 00:23, 25 March 2022
• Conventions
  === Cell naming === Cells are arranged in a grid, with each cell named by a letter and a number. Letters can be uppercase or lowercase. The
  11 KB (1,867 words) - 17:44, 4 February 2024
• Captured cell
  ...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
• Domination
  ...e the dominated cells from consideration, because moving in the dominating cell will be at least as good. This can often simplify the analysis of Hex posit ...tes another. But there are many situations where the concept of [[captured cell|capturing]] can be used to reason about domination.
  21 KB (3,995 words) - 22:37, 18 November 2023
• Intrusion
  ...e situation is even worse for Blue: Red can respond as follows, [[captured cell|capturing]] the entire corner and leaving Blue with nothing useful at all: If Blue intrudes at A, Red's response at B actually [[dead cell|kills]] Blue's stone. Therefore, such an intrusion does not help Blue at al
  6 KB (1,101 words) - 21:03, 1 October 2023
• Passing
  ...namely by deliberately making an [[irrelevant move]] (such as playing in a cell that is already captured by that player). Explicitly passing is more inform ...ng cell in P is empty, imagine that Blue moves there. If the corresponding cell in P is not empty, then it must be occupied by a blue stone (since P ≤ Q)
  8 KB (1,507 words) - 21:23, 5 November 2021
• Board
  ...lue cells are on the c-file, the red cells are on the 4-rank, and the grey cell is c4.
  4 KB (749 words) - 20:53, 28 December 2020
• Ladder creation template
  ...eft and the ladder going right (Red cannot force both simultaneously). The cell marked "+" is the only place where Blue can move to prevent Red from connec
  7 KB (1,144 words) - 14:19, 5 September 2022
• Tom's move for 3rd and 5th row parallel ladders
  ...the cells marked "*", and the only overlap (apart from the two [[captured cell]]s below 5) is at "+", so Blue must play there. Then Red responds like this ...instead Red plays the other, then whichever one Blue played will be [[Dead cell|dead]].
  11 KB (2,210 words) - 00:56, 27 July 2022
• Foldback
  ...Red has a 4th row ladder approaching a red stone at d5 (or the equivalent cell on the opposite side of the board): Similarly, consider a single red stone at c4 (or the equivalent cell on the opposite side of the board).
  3 KB (667 words) - 23:25, 23 July 2022
• Flank
  Then Red can [[climbing#Zipper|zipper]] all the way from J to the cell marked "*", by a sequence of forcing moves as follows:
  17 KB (3,144 words) - 05:31, 1 December 2022
• FIFI25 vs. murasawa, October 2021
  ...Red can just answer with e2 with d2, and f2+g1 will still be [[Captured cell|red-captured]]. ..., even b5 is almost-certainly not enough here: ​ If Blue responds in the cell Blue plays for 22, then the situation becomes the same as just after Blue p
  12 KB (2,029 words) - 23:16, 28 August 2022
• Reverse Hex
  ...ary blue stone — such a cell exists because there is more than one empty cell). .... At this point, the losing player is forced to play in the only remaining cell and loses the game. □
  11 KB (1,957 words) - 15:22, 10 July 2022
• Edge template III2g
  ...rategy]]. Whenever Blue plays in one numbered cell, Red plays in the other cell with the same number.
  573 B (88 words) - 07:32, 11 February 2022
• Theorems about templates
  ...rst in the region, ''y'' captures the whole triangle in A and ''w'' [[dead cell|kills]] the red stone and therefore captures the whole triangle in B. There ...d yield a connected shape, then the same could be achieved by removing one cell or the red stone from B, and vice versa. Therefore, the template containing
  29 KB (4,992 words) - 05:51, 21 April 2024
• Bolstered template
  ...d C are outside of the template's carrier and may or may not be empty. The cell "*" is the intrusion point in question; we call it an '''exposed''' intrusi ...e if Blue attempts to do so, Red can simply choose to respond at x, [[dead cell|killing]] Blue's stone. This never improves Blue's position, and often make
  5 KB (974 words) - 11:41, 6 May 2022
• Near ladder escape
  A single stone at c4 (or the equivalent cell on the opposite side of the board) does not escape a 5th row ladder, even w A single stone at D5 (or the equivalent cell on the opposite side of the board) does not escape a 4th row ladder, even w
  7 KB (1,441 words) - 10:27, 25 November 2023
• Efficiency
  The reason that move 2 is usually good is that it [[captured cell|captures]] the entire shaded area. However, Red needs up to two additional
  7 KB (1,138 words) - 03:24, 1 December 2022
• Question
  ...Red cannot achieve both of these things simultaneously. By playing in the cell marked "*", Blue asks the question "which or B or C do you want to connect
  6 KB (1,073 words) - 16:05, 27 November 2022
• Strategic advice from KataHex
  Know the most common [[captured cell]] patterns. It really reduces the number of moves you have to consider. Here is another common capture pattern. The other patterns on [[captured cell]] are useless because they have too many Red stones adjacent to each other,
  21 KB (3,605 words) - 16:08, 14 January 2024
• Solutions to worst move puzzles
  ...f Blue's connection, then it is a losing move for Red. If there is no such cell, then we must look for a different Blue connection. ...t a6 and c4. Moreover, Blue 1 captures the highlighted triangle and [[dead cell|kills]] f3. This means that f3 is not required for Blue's connection! Thus,
  4 KB (808 words) - 03:31, 7 October 2023
• Edge template VI1b
  ...s about edge templates]]. Unlike [[edge template VI1a]], there is no empty cell required to the left of the template's stone. For all intrusions ''except'' at the cell marked "*", the shaded area is sufficient for Red to reconnect:
  1 KB (209 words) - 01:24, 7 October 2023
• Combinatorial game theory
  * A single empty cell is a region. * The 3-cell corner is a region.
  23 KB (4,007 words) - 00:18, 12 May 2024
• Edge template VI1c
  ...to the edge within the shaded area unless Blue block at *. With the extra cell on the top left, Red can play at A and connect down with a ladder escape fo ...and, Blue intruding + cells are the only two cases requiring the top right cell, and B is a correct response for Red in both cases.
  978 B (186 words) - 02:18, 4 May 2024
• Seventh row template problem
  ...rk than checking validity. In principle, one must sequentially remove each cell from the carrier (by placing a blue stone in it) and check that the resulti
  6 KB (968 words) - 14:25, 1 December 2023
• Inferiority
  ...[captured cell|captured]] by Red: Red can get at least one of them, [[dead cell|killing]] the other. Therefore, any red stone on either X is made irrelevan
  4 KB (767 words) - 02:05, 26 April 2024
• Monotonicity
  ...some arbitrary empty cell. Should Red' strategy call for Red to move in a cell that Red pretends to be empty but that actually contains a red stone, then
  2 KB (302 words) - 02:21, 26 April 2024