Check out Alice Chess, our featured variant for June, 2024.


[ Help | Earliest Comments | Latest Comments ]
[ List All Subjects of Discussion | Create New Subject of Discussion ]
[ List Earliest Comments Only For Pages | Games | Rated Pages | Rated Games | Subjects of Discussion ]

Single Comment

Game tree complexity[Subject Thread] [Add Response]
Aurelian Florea wrote on Thu, May 23, 2019 02:10 PM UTC:

As, from what I remember, the article says considering all possible games is meaningless. So what people usually do is get statistics for the average branching factor and the length of the game. With a program like chessV you can do this. Take grand chess for example. Run 1000 games in decent conditions. Say 4mins +3 secs time. Read the data. You probably need help here but I think it can be set up. Same with Omega chess or Shako (one of your favorites I remeber) for a few more known games.

It seems to me though that you aim for the more theoretical rather than applied part of math. There might be relevant conclusions to be drawn from things like number of captures and so on as long as games are chesslike enough.  

For some games like go or havannah the game lenght is quite obvios based just on board size.

When the time I'll maybe try to deduce some such heuristics on games, I'll try on Apothecary as the final article on them is pending on my to do list along with chessV2 expeiments which I hope to be able to do soon!...