History of computer Hex - Revision history

Selinger: Copy-editing, and added a bullet for AI-based programs.

2023-01-25T23:36:00Z

Copy-editing, and added a bullet for AI-based programs.

Littlefish: typo

2010-12-02T11:12:43Z

typo

Halladba: cat. history + 2008 olympiad results

2008-10-31T23:19:06Z

cat. history + 2008 olympiad results

Halladba: added about six and hexy and queenbee

2008-01-28T23:04:31Z

added about six and hexy and queenbee

Halladba: category -> computer hex

2007-12-12T11:48:34Z

category -> computer hex

Reiner Martin: /* References */

2007-11-23T21:27:25Z

‎References

Reiner Martin: /* References */

2007-11-23T21:27:00Z

‎References

Reiner Martin: /* References */

2007-11-23T21:26:35Z

‎References

Reiner Martin at 21:21, 23 November 2007

2007-11-23T21:21:46Z

Reiner Martin: formatting

2007-11-23T21:19:42Z

formatting

@@ Line 1: / Line 1: @@
-Hex has been invented by mathematicians and the [[rules]] are basic. Therefore it is relatively easy to make a simple [[artificial intelligence]] compared to chess for instance. However the [[branching factor]] is huge and a brutal approach is not as efficient in Hex than in Chess. This fact is another similarity to [[Go]].
+Hex is a game that was invented by mathematicians and has simple [[rules]], making it relatively easy to create a basic artificial intelligence (AI) compared to more complex games like chess. However, the [[branching factor]] (the number of possible moves) in Hex is quite large, making a brute-force approach less effective than in chess. In this regard, Hex is similar to [[Go]], which also has a large branching factor.
 == Chronology ==
-* 1942 Invention of Hex.
+* Hex was invented in 1942.
-* In 1953 Shannon and Moore build an electric machine able to play Hex. The board is considered as an electric circuit with one player's ([[Blue]] for example) hexes being off switches and the other's being on switches, the empty hexes are resistances. The machine measures the global resistance of the circuit between [[Red]]'s edges, tries every move and then chooses the one that minimizes the resistance value of the circuit, trying to make it easier to join the two sides.
+* In 1953, Shannon and Moore built a machine that could play Hex by treating the board as an electric circuit. Red's hexes were considered as on switches, Blue's hexes as off switches, and empty hexes as resistances. The machine calculated the overall resistance of the circuit between Red's edges, evaluated all possible moves, and selected the move that minimized the resistance value of the circuit, trying to make it easier to join the two sides.
-* 1994 Birth of [[Queenbee]].
+* In 1994, the program [[Queenbee]] was developed.
-* In 2000 [[Hexy]] is gold medallist of the [[ICGA|5th Computer Olympiad]] in London. Hexy is the first computer program to use [[virtual connection]]s.
+* In 2000, the program [[Hexy]] won a gold medal at the [[ICGA|5th Computer Olympiad]] in London. Hexy was the first computer program to use [[virtual connection]]s.
-* July 7th 2002. [[Six]], the current best available hex playing program is created.
+* In 2002, the program [[Six]] was created. It was the best available Hex playing program at the time.
-* October 2008. [[Wolve]] is gold medallist of the 13th Computer Olympiad in Beijing. [[MoHex]] uses [[UCT]] algorithm in Hex, and plays better than Six.
+* In 2008, the program [[Wolve]] won a gold medal at the 13th Computer Olympiad in Beijing.
 == See also ==

← Older revision		Revision as of 11:12, 2 December 2010
Line 1:		Line 1:
−	Hex has been invented by ~~matematicians~~ and the [[rules]] are basic. Therefore it is relatively easy to make a simple [[artificial intelligence]] compared to chess for instance. However the [[branching factor]] is huge and a brutal approach is not as efficient in Hex than in Chess. This fact is another similarity to [[Go]].	+	Hex has been invented by mathematicians and the [[rules]] are basic. Therefore it is relatively easy to make a simple [[artificial intelligence]] compared to chess for instance. However the [[branching factor]] is huge and a brutal approach is not as efficient in Hex than in Chess. This fact is another similarity to [[Go]].

	== Chronology ==		== Chronology ==

@@ Line 6: / Line 6: @@
 * In 1953 Shannon and Moore build an electric machine able to play Hex. The board is considered as an electric circuit with one player's ([[Blue]] for example) hexes being off switches and the other's being on switches, the empty hexes are resistances. The machine measures the global resistance of the circuit between [[Red]]'s edges, tries every move and then chooses the one that minimizes the resistance value of the circuit, trying to make it easier to join the two sides.
 * 1994 Birth of [[Queenbee]].
-* In 2000 [[Hexy]] is gold medallist of the [[ICGA|5th Computer Olympiad]] in London.
+* In 2000 [[Hexy]] is gold medallist of the [[ICGA|5th Computer Olympiad]] in London. Hexy is the first computer program to use [[virtual connection]]s.
-* July 7th 2002 [[Six]], the current best hex playing program is created.
+* July 7th 2002. [[Six]], the current best available hex playing program is created.
 == See also ==
@@ Line 22: / Line 23: @@
 {{stub}}
 [[category:Computer Hex]]

@@ Line 5: / Line 5: @@
 * 1942 Invention of Hex.
 * In 1953 Shannon and Moore build an electric machine able to play Hex. The board is considered as an electric circuit with one player's ([[Blue]] for example) hexes being off switches and the other's being on switches, the empty hexes are resistances. The machine measures the global resistance of the circuit between [[Red]]'s edges, tries every move and then chooses the one that minimizes the resistance value of the circuit, trying to make it easier to join the two sides.
 == See also ==
@@ Line 15: / Line 18: @@
 * Anshelevich, Vadim V. [http://home.earthlink.net/~vanshel/VAnshelevich-01.pdf The Game of Hex: An Automatic Theorem Proving Approach to Game Programming]. See paragraphs 2 and 3 for the first Hex playing machine.
 * Gardner, Martin (1988). [http://www.amazon.com/Hexaflexagons-Other-Mathematical-Diversions-Scientific/dp/0226282546 Hexaflexagons and Other Mathematical Diversions: The First Scientific American Book of Puzzles and Games]. University of Chicago Press, ISBN 0-226-28254-6.
 {{stub}}
 [[category:Computer Hex]]

← Older revision		Revision as of 11:48, 12 December 2007
Line 17:		Line 17:

	{{stub}}		{{stub}}
		+	[[category:Computer Hex]]

@@ Line 13: / Line 13: @@
 == References ==
-* [http://home.earthlink.net/~vanshel/VAnshelevich-01.pdf Anshelevich, Vadim V., The Game of Hex: An Automatic Theorem Proving Approach to Game Programming] -  See paragraphs 2 and 3 for the first Hex playing machine.
+* Anshelevich, Vadim V. [http://home.earthlink.net/~vanshel/VAnshelevich-01.pdf , The Game of Hex: An Automatic Theorem Proving Approach to Game Programming]. See paragraphs 2 and 3 for the first Hex playing machine.
-* Gardner, Martin (1988), [http://www.amazon.com/Hexaflexagons-Other-Mathematical-Diversions-Scientific/dp/0226282546 Hexaflexagons and Other Mathematical Diversions: The First Scientific American Book of Puzzles and Games], Chicago: University of Chicago Press, ISBN 0-226-28254-6
+* Gardner, Martin (1988). [http://www.amazon.com/Hexaflexagons-Other-Mathematical-Diversions-Scientific/dp/0226282546 Hexaflexagons and Other Mathematical Diversions: The First Scientific American Book of Puzzles and Games]. University of Chicago Press, ISBN 0-226-28254-6
 {{stub}}

@@ Line 8: / Line 8: @@
 == See also ==
-[[History of Hex]]
+* [[History of Hex]]
+* [[Computer Hex]]
 [[Computer Hex]]
 == References ==