bug-gnubg
[Top][All Lists]
Advanced

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

RE: [Bug-gnubg] Measuring Complexity


From: Ian Shaw
Subject: RE: [Bug-gnubg] Measuring Complexity
Date: Wed, 9 Sep 2009 11:22:26 +0100

 

> -----Original Message-----
> From:  Massimiliano Maini
> Sent: 09 September 2009 10:51
> 
> Hmmm, to me the only measure of the "complexity" of a 
> position would be how often (i.e. a probability) and average 
> player misplays it.
> 

Another measure of complexity might be the extent to which a slightly
altered position makes a different play (or theme) correct, and by how
much. This is very much the thrust of the Ballard/Weaver book.

It's theoretically possible to program a bot to fiddle around looking at
different positions to find out what causes the correct play to change,
typically by moving one or two chequers around. Whether this is a good
use of their time is another matter.


-- Ian




reply via email to

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