Knowledge (XXG)

Havannah (board game)

Source đź“ť

28: 185:. It is a zero-learning based algorithm, as in AlphaZero, but with novelties: boardsize invariance thanks to fully convolutional neural networks (as in U-Net) and global pooling. This allows growing architectures, meaning the program can learn on a small board, and then extrapolate on a large board. 398:
Cazenave, Tristan; Chen, Yen-Chi; Chen, Guan-Wei; Chen, Shi-Yu; Chiu, Xian-Dong; Dehos, Julien; Elsa, Maria; Gong, Qucheng; Hu, Hengyuan; Khalidov, Vasil; Li, Cheng-Ling; Lin, Hsin-I; Lin, Yu-Jin; Martinet, Xavier; Mella, Vegard; Rapin, Jeremy; Roziere, Baptiste; Synnaeve, Gabriel; Teytaud, Fabien;
162:
techniques resulting in some notable improvement in playing strength. The "Havannah Challenge 2012" was held October 15–19, 2012 during which Freeling played ten games against three of the strongest Havannah-playing programs available, playing (at least) one game as black and one as white against
157:
In 2002 Freeling offered a prize of 1000 euros, available through 2012, for any computer program that could beat him in even one game of a ten-game match. For many years, computer programs lagged far behind human players. However, since 2010 several Havannah-playing programs have applied
148:
Unlike in Hex, in Havannah draws are technically possible, in practice they are extremely rare. There has been one known draw between human players. Tactics are much easier to master than strategy, and differences in playing level are considerable.
144:
In Hex, when the board is completely filled, exactly one player will have a winning connection; in Havannah a completely filled board will have usually more than one winning structures (but the game ends with first winning structure).
125:
An example of all three winning combinations is shown above. The structure in the centre of the board is a ring; the structure on the left-hand side is a fork; the structure on the right-hand side is a bridge.
208:
and is based on using ring-threats to represent the geography graph. In detail, since Lichtenstein and Sipser have proved that generalized geography remained PSPACE-hard even if the graph is only
133:
is generally implemented for fairness. This rule allows the second player to choose whether to switch positions with the first player after the first player makes the first move.
136:
Players of different strength can still play an interesting game when the weaker player (as white) is allowed to place two or more stones on the first turn.
212:, it only remains to construct an equivalent Havannah position from such a graph, which is accomplished by constructing various gadgets in Havannah. 503: 374: 98:
A player wins when they complete one of three different structures from unbroken lines, or paths, of connected stones, all of their colour:
171: 309: 508: 399:
Teytaud, Olivier; Ye, Shi-Cheng; Ye, Yi-Jun; Yen, Shi-Jim; Zagoruyko, Sergey (2020-01-27). "Polygames: Improved Zero Learning".
73:. Havannah has "a sophisticated and varied strategy" and is best played on a base-10 hexagonal board, 10 hex cells to a side. 174:
and several universities), won four times in a row on the board of size 8 against the human player with the best ELO rank on
88:
One player plays as black; the other plays as white. White starts, after which moves alternate. The rules are as follows:
518: 192:. It is played on a base-8 board and sometimes also on a base-10 board. During this competition the pie rule is used. 175: 513: 163:
each opponent. Freeling lost the challenge when he had to resign a game with white against the Lajkonik program.
105:
is a loop around one or more cells (no matter whether the encircled cells are occupied by any player or empty);
159: 21: 31:
Examples of the three winning structures in Havannah, on a base-8 board. From left to right, they are the
209: 205: 277: 324: 479: 453: 80:, with a smaller, base-8 board suitable for beginners. It is nowadays only produced by Hexboards. 425: 400: 119:, which connects any three edges of the board; corner points are not considered parts of an edge. 58: 17: 222: 305: 301: 292: 248: 189: 167: 51: 27: 435: 182: 66: 280:; Schmittberger's book wrongly states that a ring should surround at least one vacant cell. 201: 62: 181:
This result was achieved by the same program as the one used for beating best humans at
497: 488: 338: 77: 469: 439: 375:"Open-sourcing Polygames, a new framework for training AI bots through self-play" 352: 424:. The 8th Intl. Conf. on Computers and Games. Keio University, Yokohama, Japan. 166:
Until 2019, the best humans were still by far stronger than computers. However,
484: 204:
with respect to the size of the input graph. The proof is by a reduction from
54: 265: 252: 130: 129:
Since the first player to move in Havannah has a distinct advantage, the
420:
Bonnet, Édouard; Jamain, Florian; Saffidine, Abdallah (14 August 2013).
170:, based on Polygames (an open-source project, initially developed by 475: 405: 278:
http://www.mindsports.nl/index.php/arena/havannah/49-havannah-rules
16:
This article is about the board game. For the English village, see
430: 92:
Each player places one stone of their color on the board per turn.
70: 26: 112:, which connects any two of the six corner cells of the board; 95:
Stones are never moved, captured, or otherwise changed.
243:
Handscomb, Kerry, ed. (Winter 2002). "Front Cover".
61:. It belongs to the family of games commonly called 291: 178:, who was also the winner of various tournaments. 76:The game was published for a period in Germany by 339:"Human against Computer: 7-3 - Press release" 8: 429: 404: 172:Facebook Artificial Intelligence Research 300:, John Wiley & Sons, Inc., pp.  235: 422:Havannah and TwixT are PSPACE-complete 7: 188:Havannah is a recurring game at the 14: 210:bipartite and of degree at most 3 357:, Facebook Incubator, 2020-05-28 290:Schmittberger, R. Wayne (1992), 504:Board games introduced in 1981 1: 247:(12). Carpe Diem Publishing. 440:10.1007/978-3-319-09165-5_15 276:As clarified by Freeling at 354:facebookincubator/Polygames 298:New Rules for Classic Games 535: 140:Difference compared to Hex 15: 454:"Jeux & stratĂ©gie 09" 196:Computational complexity 65:; its relatives include 509:Abstract strategy games 160:Monte Carlo tree search 22:Havana (disambiguation) 44: 20:. For other uses, see 206:generalized geography 30: 223:Jeux & StratĂ©gie 200:Solving Havannah is 519:Ravensburger games 59:Christian Freeling 45: 18:Havannah, Cheshire 190:Computer Olympiad 153:Computer Havannah 52:abstract strategy 526: 514:Connection games 480:Sensei's Library 458: 457: 450: 444: 443: 433: 417: 411: 410: 408: 395: 389: 388: 386: 385: 371: 365: 364: 363: 362: 349: 343: 342: 335: 329: 328: 321: 315: 314: 295: 287: 281: 274: 268: 263: 257: 256: 240: 63:connection games 50:is a two-player 534: 533: 529: 528: 527: 525: 524: 523: 494: 493: 466: 461: 452: 451: 447: 419: 418: 414: 397: 396: 392: 383: 381: 379:ai.facebook.com 373: 372: 368: 360: 358: 351: 350: 346: 337: 336: 332: 323: 322: 318: 312: 289: 288: 284: 275: 271: 264: 260: 242: 241: 237: 233: 218: 202:PSPACE-complete 198: 155: 142: 86: 25: 12: 11: 5: 532: 530: 522: 521: 516: 511: 506: 496: 495: 492: 491: 482: 473: 465: 464:External links 462: 460: 459: 445: 412: 390: 366: 344: 330: 325:"Little Golem" 316: 311:978-0471536215 310: 282: 269: 258: 245:Abstract Games 234: 232: 229: 228: 227: 217: 214: 197: 194: 154: 151: 141: 138: 123: 122: 121: 120: 113: 106: 96: 93: 85: 82: 13: 10: 9: 6: 4: 3: 2: 531: 520: 517: 515: 512: 510: 507: 505: 502: 501: 499: 490: 489:BoardGameGeek 486: 483: 481: 477: 474: 472:MindSports.nl 471: 470:Official site 468: 467: 463: 455: 449: 446: 441: 437: 432: 427: 423: 416: 413: 407: 402: 394: 391: 380: 376: 370: 367: 356: 355: 348: 345: 340: 334: 331: 326: 320: 317: 313: 307: 303: 299: 294: 286: 283: 279: 273: 270: 267: 262: 259: 254: 250: 246: 239: 236: 230: 225: 224: 220: 219: 215: 213: 211: 207: 203: 195: 193: 191: 186: 184: 179: 177: 173: 169: 164: 161: 152: 150: 146: 139: 137: 134: 132: 127: 118: 114: 111: 107: 104: 100: 99: 97: 94: 91: 90: 89: 83: 81: 79: 74: 72: 68: 64: 60: 56: 53: 49: 42: 38: 34: 29: 23: 19: 456:. June 1981. 448: 421: 415: 393: 382:. Retrieved 378: 369: 359:, retrieved 353: 347: 333: 319: 297: 285: 272: 261: 244: 238: 221: 199: 187: 180: 165: 156: 147: 143: 135: 128: 124: 116: 109: 102: 87: 78:Ravensburger 75: 57:invented by 47: 46: 40: 36: 32: 478:article on 176:LittleGolem 498:Categories 406:2001.09832 384:2020-05-29 361:2020-05-29 293:"Havannah" 231:References 168:MetaTotoro 84:Game rules 55:board game 431:1403.6518 266:Hexboards 253:1492-0492 485:Havannah 476:Havannah 131:pie rule 48:Havannah 39:and the 216:Reviews 308:  302:116–17 251:  110:bridge 41:bridge 35:, the 426:arXiv 401:arXiv 71:TwixT 306:ISBN 249:ISSN 117:fork 103:ring 69:and 37:ring 33:fork 487:at 436:doi 183:Hex 67:Hex 500:: 434:. 377:. 304:, 296:, 226:#9 115:A 108:A 101:A 442:. 438:: 428:: 409:. 403:: 387:. 341:. 327:. 255:. 43:. 24:.

Index

Havannah, Cheshire
Havana (disambiguation)

abstract strategy
board game
Christian Freeling
connection games
Hex
TwixT
Ravensburger
pie rule
Monte Carlo tree search
MetaTotoro
Facebook Artificial Intelligence Research
LittleGolem
Hex
Computer Olympiad
PSPACE-complete
generalized geography
bipartite and of degree at most 3
Jeux & Stratégie
ISSN
1492-0492
Hexboards
http://www.mindsports.nl/index.php/arena/havannah/49-havannah-rules
"Havannah"
116–17
ISBN
978-0471536215
"Little Golem"

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑