Hex, Havannah: Built JHex tree for top 6 pages' players

6 replies. Last post: 2012-05-12
Reply to this topic       Return to forum

Built JHex tree for top 6 pages' players 2012-01-22 Zeycus ★ As a Python exercise (a programming language I find superb) I have built a JHex tree with all the games in LittleGolem for which at least one of the players is currently in the first six pages of the top players list. That means rating 1695 or above. They are 26368 games, each leaf containing as a comment the game number in LG. It is hopefully correct (if anyone finds a mistake, please let me know!). Surprisingly, many starting moves that are very probably winning appear as loosers in this subtree of played games (sorry, I had prepared the image but I have no clue how to imbed it here :-) ). In case someone finds it useful, the tree is downloadable in: http://www.2shared.com/file/Fk72ZNL8/gamesPage06.html Just click “download”, in the bottom of the page. Cheers! 2012-01-25 Christian K ★ When playing with swap rule, all starting moves are losing moves, no? 2012-01-26 Zeycus ★ I am not very sure what you mean. Starting moves in a game are not winners or losers, only the leaves of the tree. In the games when second player swaps, that move is removed and all the remaining moves are reflected with respect to the long diagonal. In checked inside the tree a couple of my games in which there was swap. http://www.littlegolem.net/jsp/game/game.jsp?gid=111635 http://www.littlegolem.net/jsp/game/game.jsp?gid=137810 In the first the swapper lost. In the second, he won. I found both games in the tree and they seem correctly marked. Do you mean some games were declared “won” to the loser? If so, could you tell me the number? 2012-01-26 Dvd Avins He means that with perfect play, whoever moves first, no matter where they play. The position is inherently lost (from a theoretical point of view) before the first player makes their move and that dos not (can not) change with the move. Because, of course, any move that would be theoretically winning is swapped and any move that is theoretically losing is not. 2012-01-26 Zeycus ★ Oh, thank you for the clarification, of course I agree. The way JHex works, not including the swap option, as the eval in the root node I would have expected to see something similar to http://www.hexwiki.org/index.php?title=Small_boards But it is totally different. 2012-05-12 David J Bush Zeycus, thanks for the file. It’s not very surprising that many central moves are labeled as losing, because strong players do not tend to play there on the first move. BTW there is a Ruby sqripte for downloading games manually into a Jhex file, see the JHEX thread. There’s a trick it uses when downloading a game where swap was played. For example 1.A5 2.swap is turned into 1.E1 2.E1 This preserves the move numbering, and the position looks like LG, not a reflection along the long diagonal. Also if you didn’t know, there is a new version of Jhex, See the “new version” thread.

Reply to this topic