On Mon, 2007-03-26 at 12:33 -0800, [EMAIL PROTECTED] wrote:
> > Your idea is useful if it can be show to be superior in some
> > way to other move generation techniques. It may be superior
> > in speed or some other metric.
> >
>
> Main superiority I can think of: It becomes easy to combine condi
> Your idea is useful if it can be show to be superior in some
> way to other move generation techniques. It may be superior
> in speed or some other metric.
>
Main superiority I can think of: It becomes easy to combine conditions
like (example) "All points with one black piece above and one whit
> For example, something I suggested the last time I was on a computer
go
> list, back in the 90's: Take an array of 7 64-bit integers...
I believe very similar techniques are pretty common - I don't know
how common but it's been used before.
I believe you might as well just use use bit-boa
On 3/25/07, forrest curo <[EMAIL PROTECTED]> wrote:
Does this bunch ever get around to the merits of various ways of
representing the board and arriving at moves?
Sure, e.g.:
http://computer-go.org/pipermail/computer-go/2006-December/thread.html#7452
For example, something I suggested the l
Since I signed up for this list, I've been receiving all sorts of
material about how to test existing programs against one another.
Does this bunch ever get around to the merits of various ways of
representing the board and arriving at moves?
For example, something I suggested the last time I
