reviving old c# codebase engine, 0x88

[lauriet]

In your original post you said:


right now there is no hashing, no ai, no transposition table no nothing, it's just a simple move generator

"no nothing !!!!!!!"

that's a double negative !!!

How can you program boolean logic when you talk like that ?????

[hgm]

[Edit] The aligned[] table elements could have the same format as the set of aligned piece-direction combinations. Each piece could then have a mask associated with it (in the piece list) to indicate the piece-direction bits that belong to it. The incremental update would then be

alignedSet &= ~sliderMask[piece];
alignedSet |= sliderMask[piece] & aligned[toSqr - location[opponent+KING]];

can you tell what kind of % speed increase you got with your engine? if any

I don't even have an engine at the moment where I could test that. I suppose I could test in on Qperft.

But I will surely investigate it in the "mailbox trials" project, when I have time again to work on that.

[lithander]

In your original post you said:


right now there is no hashing, no ai, no transposition table no nothing, it's just a simple move generator

"no nothing !!!!!!!"

that's a double negative !!!

How can you program boolean logic when you talk like that ?????

The copious amount of times you used the NOT operator (!) in your post makes your central point of critizism quite ironic!

[spirch]

But I will surely investigate it in the "mailbox trials" project, when I have time again to work on that.

i see that you are actively working on it, did you had the chance / time to look into it?

[hgm]

No, not yet. At the moment I don't have any pin detection at all. Nor check detection, for that matter; my test search still relies on detecting (and scoring) the King capture in the child node. I am still working on the basic method of move generation.