Search results

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

• Jonathan Rydh's strategy guide
  ...se cases you can fill in the gaps with stones and still have an equivalent position. ...his rule is if you have enough ground already and are sitting on a winning position. In that case, care should instead be taken to minimize the opponent's gain
  14 KB (2,557 words) - 20:29, 11 September 2021
• Open problems about edge templates
  ...ong the 4th row and Blue suddenly decides to play elsewhere (move 1 in the position below). ...ht imagine that custom computer code could be used to analyse this sort of position, and of course computers get faster over time so perhaps this problem will
  7 KB (1,215 words) - 02:29, 9 November 2023
• Theory of ladder escapes
  ...w ladder escape means (among other things) that Red must win the following position: and now we are back at the previous position with the ladder right next to the escape, where we have already seen that R
  123 KB (22,870 words) - 19:37, 2 April 2024
• Peep
  ...with suitable surrounding conditions. For example, consider the following position, where Red is connected to the bottom edge by a [[ziggurat]].
  8 KB (1,413 words) - 00:27, 16 August 2022
• Tenuki
  ...te new opportunities on the board and exploit weaknesses in the opponent's position. As more and more stones are played in an area, that area becomes less attr ...While local play is important for maintaining control and defending one's position, tenuki allows players to expand their influence on the board and exploit o
  2 KB (309 words) - 04:06, 23 January 2023
• Joseki
  ...ing on how far from an edge the first move by player A was. When the final position is reached, player A has a fixed escape on one side of the corner and playe This position might be reached if both players want an escape on the top.<br/>
  10 KB (1,802 words) - 20:09, 9 March 2024
• David Boll Hex FAQ
  ...the key to the best defense from 4 rows out, it's also typically the best position from which to defend on a wide open board. threatens to connect to F6, and is in the 'classic' defensive position
  15 KB (2,732 words) - 19:08, 28 December 2020
• GTP
  | Show the list of all legal moves for the current position.
  6 KB (848 words) - 00:23, 25 March 2022
• Conventions
  * '''Swap sides:''' Upon playing a swap move, the board position stays the same and the players change colors. ...:''' Upon playing a swap move, the players keep their colors and the board position is mirrored (ranks and files interchanged) and the color of the pieces is i
  11 KB (1,867 words) - 17:44, 4 February 2024
• Captured cell
  ...turing player's pieces, as this does not change the strategic value of the position. ...can play at a, killing b. Therefore, both cells are captured and the above position is strategically equivalent to the following.
  10 KB (1,893 words) - 23:42, 14 February 2024
• Domination
  ...as good. In Hex, we say that a cell X dominates another cell Y in a given position (and from a particular player's point of view) if playing at X is at least For example, in the following position, each of the cells marked "*" dominates the other two. So any of these move
  21 KB (3,995 words) - 22:37, 18 November 2023
• Optimal play
  For the purpose of the following definitions, by a '''position''', we mean an arrangement of pieces on the Hex board, together with the in ...ition'''. A move is called a '''winning move''' if it results in a winning position for the player who made the move; otherwise it is called a '''losing move''
  3 KB (470 words) - 23:15, 28 August 2022
• Passing
  ...ece (no matter which piece) always leaves the player in an equal or better position than passing would do. Nevertheless, there are a number of good reasons for ...player may choose to pass as a way of demonstrating the strength of their position to the opponent. In a friendly or teaching game, this can have a pedagogica
  8 KB (1,507 words) - 21:23, 5 November 2021
• Tidiness
  To illustrate that this can make a difference, consider the following position, with Blue to move. In this situation, "a" is winning, but "b" and all othe To illustrate that this can make a difference, consider the following position, with Red to move. In this situation, "a" is winning, but "b" and all other
  3 KB (510 words) - 03:21, 16 June 2021
• Flank
  ...er, they usually do not hurt and may be useful to Red by solidifying Red's position below the flank.
  17 KB (3,144 words) - 05:31, 1 December 2022
• Pivoting template
  ...hand, if we use a proper pivoting template in the analogous situation, the position is winning for Red:
  9 KB (1,667 words) - 08:02, 1 March 2024
• FIFI25 vs. murasawa, October 2021
  22. d8 ​ ​ ​ ​ Very Good: ​ ​ Before I saw Blue play this, the position looked good for Red. ​ With this move, I am almost-certain that Blue wins
  12 KB (2,029 words) - 23:16, 28 August 2022
• Reverse Hex
  For example, consider the following position, with Blue to move: Consider the pairs (c,b) and (d,f). Blue, the first player to move in this position, can occupy c, force Red to occupy b, and force Red to occupy at least one
  11 KB (1,957 words) - 15:22, 10 July 2022
• Theorems about templates
  ...any position containing A is winning for Red, then so is the corresponding position containing B.
  29 KB (4,992 words) - 05:51, 21 April 2024
• Bolstered template
  ...spond at x, [[dead cell|killing]] Blue's stone. This never improves Blue's position, and often makes it worse. Consider the following position, with Blue to move:
  5 KB (974 words) - 11:41, 6 May 2022
• Near ladder escape
  ...[[Joseki#4th_row_josekis|4th row joseki]] "C", which leaves the following position in an acute corner: This position obviously escapes 2nd row ladders. It is perhaps less obvious that it also
  7 KB (1,441 words) - 10:27, 25 November 2023
• Openings on 11 x 11
  ...and b8 cutting up Blue's edge. For example, if Blue plays as follows, the position is completely winning for Red: ...an b10, ''Red'' can play b10 which combines efficiently with a9, and Red's position actually seems quite strong. For example:
  11 KB (2,022 words) - 14:15, 22 October 2022
• Efficiency
  ...ding does not work in every situation. For example, consider the following position with Red to move. Red cannot fast forward the ladder. ...layer's moves). For example, from Red's point of view, the efficiency of a position is the worst-case number of turns that Red must play before Red wins. Small
  7 KB (1,138 words) - 03:24, 1 December 2022
• Question
  ...ng in the center of a [[wheel#U-turn|U-turn]]. The U-turn is the following position, consisting of two [[Multiple_threat#Overlapping_threats|overlapping]] brid The following is a position where asking this question is the only winning move for Blue:
  6 KB (1,073 words) - 16:05, 27 November 2022
• Openings on 19 x 19
  ...not play 4-4, because then Red could play 5-4, and he would be in the same position that he would've been, had he played the first move correctly (via the Red ...en more so. Anecdotally, when KataHex thinks '''H''' is the best move in a position, it rarely assigns a high policy to the move, only liking the move after so
  31 KB (5,546 words) - 14:54, 18 November 2023
• Reading
  ...her strategy games, '''reading''' is the mental process of analyzing a Hex position by considering the possible moves and variations than can occur. By explori
  1 KB (218 words) - 20:04, 6 May 2023
• Strategic advice from KataHex
  Most of the time, you should play at Red 1 in the position below when given the opportunity, because you capture the hexes marked (*). ...hite resigned in a winning position according to the bot, though the final position is highly tactical). KataHex actually thinks Black has only an 18% win rate
  21 KB (3,605 words) - 16:08, 14 January 2024
• Losing play
  ...mplify.'' Don't play any moves that would unnecessarily simplify the board position and clarify the situation for your opponent. For example, if your opponent ...shing move is a bad idea, because when the opponent foils, it worsens your position. But in losing play you literally have nothing else to lose, so you may as
  5 KB (818 words) - 02:58, 2 October 2023
• Combinatorial game theory
  Consider a region of the Hex board. By a ''position'' in the region, we mean the state of the region after zero or more moves h Players change positions by making moves. In a given position, we say that ''Red's options'' are all positions that Red can reach by maki
  23 KB (4,007 words) - 00:18, 12 May 2024
• KataHex
  ...ents Monte Carlo tree search with a convolutional neural network providing position evaluation and policy guidance. ...starting position. It seems to be particularly thrown off if the starting position does not have the same number of black and white stones.
  3 KB (422 words) - 23:49, 16 January 2024
• Inferiority
  ...s response, Red's stone could be removed without changing the value of the position. ...er than X, then by [[monotonicity]], the same move is also winning for the position (Empty,Empty), proving the claim. If that winning move is X, then (Red,Blue
  4 KB (767 words) - 02:05, 26 April 2024
• Monotonicity
  ...r of cells from Blue to Empty and/or from Empty to Red, then the resulting position is still winning for Red. Of course, the analogous property holds from Blue ...ing path in Red's pretended position, Red has a winning path in the actual position as well.
  2 KB (302 words) - 02:21, 26 April 2024