News for hackers. Stuff that matters.
Re:Hexagonal grids for games by sergiosgc on Monday June 03, 2013 @06:38AM (#5812429)
I imagine the basic chess algorithms adapt nicely for Hex. A min-max with alpha-beta prunning and, if needed, nega-scout. The trick is designing a good heuristic for game board state evaluation (non-final board states, of course). For Hex, this should be fairly trivial: How many pieces needed to win, how vulnerable am I to being blocked.

References:

http://en.wikipedia.org/wiki/Minimax

http://en.wikipedia.org/wiki/Alpha-beta_pruning

http://en.wikipedia.org/wiki/Negascout

There are no comments on this comment yet.