Difference between revisions of "History of computer Hex"

From HexWiki
Jump to: navigation, search
(cat. history + 2008 olympiad results)
(Copy-editing, and added a bullet for AI-based programs.)
 
(One intermediate revision by one other user not shown)
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 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 ==
 
== 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.  
 +
* In 2009, the program [[MoHex]] was developed. It uses the UCT algorithm and is currently one of the best non-AI computer Hex players. It is also a reasonably efficient Hex solver.
 +
* Starting in the mid-to-late 2010s, it became much easier to train artificial intelligences, and there are now a number of very strong AI-based computer Hex players. The best ones consistently beat the best human players.
  
 
== See also ==
 
== See also ==

Latest revision as of 23:36, 25 January 2023

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

  • Hex was invented in 1942.
  • 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.
  • In 1994, the program Queenbee was developed.
  • In 2000, the program Hexy won a gold medal at the 5th Computer Olympiad in London. Hexy was the first computer program to use virtual connections.
  • In 2002, the program Six was created. It was the best available Hex playing program at the time.
  • In 2008, the program Wolve won a gold medal at the 13th Computer Olympiad in Beijing.
  • In 2009, the program MoHex was developed. It uses the UCT algorithm and is currently one of the best non-AI computer Hex players. It is also a reasonably efficient Hex solver.
  • Starting in the mid-to-late 2010s, it became much easier to train artificial intelligences, and there are now a number of very strong AI-based computer Hex players. The best ones consistently beat the best human players.

See also

References