Re: [Bug-gnubg] Measuring Complexity

[Joseph Heled]

I think it is not an easy one. My personal view is that a position is
"complex" if there are several *different*  top moves which are very
close in equity. Now it all hangs on what "different" means :)

-Joseph

On Thu, Sep 3, 2009 at 11:13 PM, Michael
Depreli<address@hidden> wrote:
> 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?
>
> Michael
>
> ________________________________
> Have more than one Hotmail account? Link them together to easily access
> both.
> _______________________________________________
> Bug-gnubg mailing list
> address@hidden
> http://lists.gnu.org/mailman/listinfo/bug-gnubg
>
>