Search results

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

• 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