Large search depths

[Desperado]

Is there a LMR implementation for beginners ? Only a few conditions and guaranteed to work. And can you apply LMR within null move pruning for
they both are applied when not in PV. And if you use LMR in null move pruning what should be the value of R. And what to do about moves at the end that are reduced all the time and may become reduced too much.

When you reduce with LMR, always reduce two plies.
This is a very good compromise between simplicity and strength.

Joona, this is a well known troll, don't waste your time with him....now he is all excited because he thinks he has caught a new big fish

Marco, i am not sure he is trolling with intention.

I respect that he is writing his own engine, doesnt matter if it seemed to be doomed, the way he is doing it. ( my impression from following some posts of some threads he was involved )

It is more appreciated like having engines like Sting, where twiddling some parameters and changing some lines of code ... and so on...

Lack of knowledge and experience and maybe some skills which can be learned with time is not trolling ( imho ).

On the other hand, making general conclusions and ignoring some advice of experts who developed the world strongest chess engines does not show a potential to progress on.

I _rarely_ commented posts like this over the last years, but i would like
to see Henk becoming a member of the computer chess programmers community,

_if_ he is willing to progress on and starts to listen some of the experts opinions.

@Henk

My advice for you is, restart your chess engine project. Although Don mentioned that "elo" is everything, i disagree at the stage you are ( i think at which you are ). Get a stable engine that simply plays chess and dont care about the level.

My next advice is, dont care about performance, learn everything about data structures you need to write a chess engine with the same goal as already mentioned, get a engine playing stable and dont care about the level.

One more, when you reached that goal, and you know because of the experience of many other chess engine authors, that a technique is working, "get it to work" and you will learn how hard chess programming can be. Dont expect these things as easy doing within minutes of implementation time. Dont think that a today 2600 engine is a must have for everyone. This level was world class level some years ago and it is and keeps to be hard work.

Best
Michael

[Henk]

Is there a LMR implementation for beginners ? Only a few conditions and guaranteed to work. And can you apply LMR within null move pruning for
they both are applied when not in PV. And if you use LMR in null move pruning what should be the value of R. And what to do about moves at the end that are reduced all the time and may become reduced too much.

When you reduce with LMR, always reduce two plies.
This is a very good compromise between simplicity and strength.

Reducing with two plies in LMR makes the search depth increase to depth 15 or 20 but you don't reach depth 30. So how do they get that ?

[mar]

Reducing with two plies in LMR makes the search depth increase to depth 15 or 20 but you don't reach depth 30.

Reduce 10 plies, be brave!