[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Bug-gnubg] Measuring Complexity

From: Michael Depreli
Subject: [Bug-gnubg] Measuring Complexity
Date: Thu, 3 Sep 2009 11:13:26 +0000

I posted this on BGO:
Has anyone ever tried to tackle the subject of measuring complexity in backgammon? Firstly you could take out moves / cube actions "that are completely unimportant". You include opening moves and maybe even replies amongst those? After that maybe you could use the move filters within BG software to assign a value. So let's say using gnubg analysis no plays get analysed at 2-ply as it's trivial then that move gets discarded. After that you could assign some kind of values based on how many moves and how big an equity difference they are away from the best play at 2-ply to reach a figure and divide it by the total plays. I'm no mathematician so wouldn't know how to weight these factors etc. Any thoughts or does no one really care?


Have more than one Hotmail account? Link them together to easily access both.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]