Github link: https://github.com/Koma1867/Soomi-V1-Ch ... -in-golang
Open to any suggestions of how to improve the engine, i have tried to keep code as understandable as possible.
Moderator: Ras
Have you tried moving promotions lower in the list? For faster cutoff's pieces must dissapear. If there arise (extra) queens then the situation gets more complex in stead of more simple.Move ordering is simple of Hash move first, then promotions, captures sorted by MVV-LVA, and lastly killer moves.
I would think it depends on the current evaluation. It is indeed good search strategy to try to cause a beta cutoff with the move that will have the smallest tree (e.g. due to simplifying the position). But the move must be good enough to actually score above beta. And if it doesn't do so immediately, there is a high chance it won't do it at all, because after it the opponent will have the move. This is why most engines only try a null move when the current evaluation is already above beta.Bart Weststrate wrote: ↑Fri Oct 24, 2025 8:11 amHave you tried moving promotions lower in the list? For faster cutoff's pieces must dissapear. If there arise (extra) queens then the situation gets more complex in stead of more simple.Move ordering is simple of Hash move first, then promotions, captures sorted by MVV-LVA, and lastly killer moves.![]()