🚀 go-pugleaf

Hello,

I'm looking for a quick way to representation.

I'm looking after all possible moves, that i put in an array,
but i need also to know which piece(s) cover that field;

GNU-chess has got 2 arrays, filled by :  ataks()
where all fields that are covered increments the array by one,
and is putting in the first bits what piece it was.

Now my problem: i'm not only looking for a function that does this,
but it must also give quickly the position where that 
piece that is covering this field.

The calculation of this function may be somewhat slow, but reading
the data must be quick!

It is meant for a knowledgebased chessprogramm.
Parsing/processing all knowledge is taking a long time, if i must
recalculate every time the position where the piece covering that
field must come from!

Greetings, Vincent Diepeveen.

vdiepeve@cs.ruu.nl
--
                +--------------------------------------+
                ||  email  : vdiepeve@cs.ruu.nl       ||
                ||  fidonet: 2:280/206.23             ||
                +======================================+