Search results

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

Page title matches

• Connection game
  ...between some parts of the [[Board (general)|board]]. The first connection game was [[Hex]], which was invented in 1942. Several others have been created :The original connection game. Played on a [[Printable boards|rhombic hex grid]].
  2 KB (325 words) - 04:10, 30 May 2023
• V vs. H game 1
  == Game information == The following is an annotated transcript of a Hex game. Follow along
  5 KB (985 words) - 00:28, 9 February 2022
• Wroclaw game 01
  1 KB (265 words) - 16:27, 1 January 2023
• Wroclaw game 02
  Note: this game record has errors. For example, i9 is played twice, first by Red and then b
  3 KB (612 words) - 02:10, 18 August 2022
• Wroclaw game 03
  927 B (193 words) - 16:31, 1 January 2023
• Wroclaw game 04
  3 KB (753 words) - 16:39, 1 January 2023
• Wroclaw game 05
  2 KB (537 words) - 16:43, 1 January 2023
• Wroclaw game 06
  711 B (136 words) - 16:23, 1 January 2023
• Wroclaw game 07
  == Game record == The game record originally stated 12. j7, but that must have been a typo since Red p
  1 KB (247 words) - 16:56, 1 January 2023
• Wroclaw game 08
  942 B (221 words) - 16:51, 1 January 2023
• Wroclaw game 09
  867 B (167 words) - 16:54, 1 January 2023
• Smart Game Format
  .... It's a text-only, tree-based format that was originally designed for the game of [[Go]], but has been adapted for a number of other games including Hex. ...be used for many kinds of tree-like data and is not necessarily limited to game trees.
  16 KB (2,720 words) - 14:16, 8 January 2023
• Game sites
  28 B (3 words) - 11:51, 3 December 2007
• Board Game Arena
  Board Game Arena ([https://www.boardgamearena.com www.boardgamearena.com]), often abbr Currently, Board Game Arena is the most popular [[online playing|site]] for playing real-time Hex
  4 KB (629 words) - 04:08, 20 December 2023
• Combinatorial game theory
  ''This page is about the combinatorial game theory of Hex. For combinatorial game theory in general, see [https://en.wikipedia.org/wiki/Combinatorial_game_th ...s of the Hex board), and each component analyzed separately. Combinatorial game theory can be used to reason about such concepts as [[domination]], reversi
  23 KB (4,007 words) - 00:18, 12 May 2024

Page text matches

• Piet Hein
  ...6) was a Danish poet, mathematician, and designer, and the inventor of the game of [[Hex]]. He is widely known for his contributions to both the literary a
  1 KB (190 words) - 00:10, 2 May 2023
• Center opening
  When playing a [[handicap]] game on a small board, a common strategy to defend against the center opening is
  2 KB (372 words) - 03:58, 13 September 2021
• Bottleneck
  The '''bottleneck''' is a strategic formation in the game of Hex where one player blocks the opponent's progress by occupying key pos ...and counter bottleneck formations is an important aspect of mastering the game of Hex.
  1 KB (245 words) - 02:30, 10 May 2024
• History of Hex
  ...Politiken] on 26 December [http://en.wikipedia.org/wiki/1942 1942] but the game was introduced to an association of math students at The University of Cope ...to [[Martin Gardner]], some of the Princeton students also referred to the game as "John", because it was often played on the hexagonal tiles of bathroom f
  5 KB (805 words) - 04:10, 30 May 2023
• Swap rule
  ...ue. Whichever player ends up being Blue makes the second move and then the game continues as usual. ...ayer]] has a considerable advantage. The swap rule was devised to make the game more even. Namely, if the first player plays a move that is too strong, the
  9 KB (1,588 words) - 14:53, 18 November 2023
• Common mistakes
  However, playing c2 in this stage of the game is a losing move because Blue can play f2 or e2. (Previously this page stat Now Blue cannot block Red's connection. A further development game could be: d2, c3, d3, b5 and Red makes a double [[Bridge|bridge]], connecti
  2 KB (379 words) - 03:58, 18 December 2020
• Rules
  ...rallel edges having the same color. The board is empty at the start of the game. On the left you can see an empty Hex board. ...en their designated edges (red for one player and blue for the other). The game is guaranteed to end with a winner as it is impossible for one player to su
  2 KB (313 words) - 14:01, 20 January 2023
• Board size
  : Offered on [[Board Game Arena]] as default. : Offered on [http://en.boardgamearena.com Board Game Arena].
  1 KB (210 words) - 05:29, 23 May 2024
• Polish phrases
  ...nd abbreviations, making it possible to convey very exactly some common in-game messages. : an invitation to a game
  795 B (120 words) - 23:26, 30 December 2007
• Basic (strategy guide)
  [[Hex]] is a two player [[Wikipedia:Board_game|board game]] played on an ''n × n'' grid of [[hexagon]]s. ...e by forcing the first player to make a move that leads to a roughly equal game. If the first player makes a very strong opening move, the second player wi
  15 KB (2,693 words) - 23:24, 12 October 2022
• ICGA
  The ICGA organises a yearly tournament for all game engines in many games, including [[Hex]].
  1,014 B (128 words) - 15:23, 26 July 2021
• Useless triangle
  ...ed from the game — that is, it cannot have any effect on the rest of the game regardless of the rest of the position. Notice that any red path through c
  1 KB (230 words) - 01:47, 12 September 2021
• Forcing move
  ...xpect that the bridge may become important later in the game. Later in the game, it may turn out that the bridge is no longer important to the opponent's c
  6 KB (1,139 words) - 15:33, 7 October 2023
• Minimaxing
  ...a.org/wiki/Minimax minimax computer algorithm] that is used to explore the game tree and select a move.
  5 KB (895 words) - 02:18, 5 October 2023
• John Nash
  ...omist and mathematician who made significant contributions to the field of game theory, the study of strategic decision making. He is best known for his wo ...nd a friend of [[Piet Hein]]. Therefore, Nash may have been exposed to the game, perhaps without realizing it. See [[History of Hex]] for more details.
  2 KB (380 words) - 02:55, 21 April 2023
• Ladder escape
  ...] (the [[ladder handling|attacker]]) to connect the ladder and [[win]] the game. Red can keep [[ladder handling|pushing]] the ladder, forcing [[Blue (playe ...ion can be used to escape Red's third row ladder and enable Red to win the game.
  4 KB (815 words) - 02:00, 8 January 2023
• Climbing
  ...of bridges and adjacent moves is common. Here is an example from an actual game. Red to move.
  14 KB (2,655 words) - 12:53, 27 April 2024
• Sound connection
  Every game is a fight over [[Advantage|control]] of the board. Control is often gained
  1 KB (165 words) - 22:55, 18 January 2024
• Intermediate (strategy guide)
  ...rom the game — that is, it cannot have any effect on the rest of the game regardless of the rest of the position. ...escape''' which allows Red to jump a move ahead of the ladder and win the game. The piece at h2 is called the "[[escape piece]]." Red should now play alon
  26 KB (4,694 words) - 01:56, 18 May 2022
• Win
  The game is won when there's a path between opposite sides of the board. The player In this game [[Red]] has built a path between the top and the bottom (which are both red
  563 B (126 words) - 22:05, 28 December 2020