TalkChess.com

That sounds like a bug. A triangular PV table could help you debug it. If it helps, I have an implementation here that you could use/modify: https://bitbucket.org/odomobo/gearheart ... vTable.hpp

Also, one other thing to note: if you have qsearch (so the engine understands that captures have consequences), then a simple material-only evaluation won't encourage the engine to make any progress, in general. It'll take advantage of guaranteed tactics, but otherwise will essentially do random mov...

Oh my bad, you said it gives 100 or -100 from the initial position. It should give 0 for depths 1 and 2 (maybe even 3), but 100 or -100 for the rest (since it's easy to capture, e.g. a pawn with a queen on a given move, if you don't have to worry about the consequences). Something else that you migh...

Your code looks fine at initial glance. One issue I see is you claim that your code isn't working, but you aren't giving examples of what you're seeing vs what you expect to see. With a lack of qsearch, the horizon effect should be really bad. The way it's written, I would expect to see scores overs...

lucasart is right. Instead of an array of a pointer of 2d arrays, you're better off having a single 3d array. There are techniques you can use such that this will strictly be more efficient, never less efficient. u08 mvsB[][64][8]; // references to sub-arrays u08 (&mvsNW)[64][8] = mvsB[0]; u08 (&mvs...

I played around with it, and figured out how to do it with a natural array. However, I personally find the notation more confusing. u08 mvsNW[64][8]; //... u08 (*mvsB[])[64][8] = { &mvsNW, &mvsNE, &mvsSW, &mvsSE }; // ... auto & mvs = *mvsB[i]; m->ts = mvs[m->fs][j]; I also found another way to do t...

Actually, something I just realized is that c++ doesn't like the notation for pointers to normal arrays, so std::array will help us out here. Maybe there's a way to do it, but if so it's beyond me. // These are vectors for the bishop. Ex: mvsNW[A1][0] is the number of squares. [A1][1-7] are the to s...

Can you post the declaration for mvsNW? Then I can walk you through it. it shouldn't require std::array to get this to work the way you want. Decaying to a pointer doesn't actually affect you right now, but I can show you an example: void foo() { int arr[10]; // ... bar(arr); // this works; int arra...

BTW, std::array should have the same performance as a normal array. The purpose of having std::array in the language (as I understand it) is providing a strong type to represent an array (i.e. it won't decay to a pointer) and provides additional features (i.e. runtime bounds checking with .at() ). O...

The nature of your learning disability eludes me a little bit. Your code seems pretty sophisticated, which is not what I would have expected with a learning disability. It's a personal issue, so I understand if you don't want to talk about it, but I am curious to understand it further.