Before I released Rodin I was testing two ideas I had, but they were not successfull. I write them here to know if anyone has testing something similar with success.
1) As I have a pawn hash, I know in almost every node when a passed pawn has been created compared to previous node. Is a cheap an effective way to know about it. My idea was that in those moment I can increase "security margins", I mean, futility margin incress 100, delta_prunning increase 100 also, and so on..... The idea is the passed pawn could make prunning techniques to lie about real situation.
For me, althought logical, this did not increase elo.

2) Knowing if a node is in check after making the move is relatively expensive. Why dont to store check information in the hash table? it is cheap, only two bits needed (00 - Check has not been computed, 01 - position is not check, 10 - position is check). It is possible also that no lose of slot because to add this data. A possibility is to add those bits to flag integer, so the only cost would be to extract or make that information for an integer.
The idea is compute if is check is needed sometime which can be saved storing that information in the hash.
Has anyone tested any of this ideas??? I did not get any good result, but maybe I did not make the correct fixed or tests......
Best regards,
Fermin