You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Thanks a lot for this very impressive library, very useful for people like me, totally unable to understand how bitmap works 😉
I saw that the issue 5, 76 and 112 (related to board.isMoveLegal returning true for some illegal moves) are closed.
I wonder how I can check if a move is pseudo-legal without generating the whole moves list. If it’s not possible, may I suggest adding a method to do that?
Here is my use case: A classical tree search optimization is to check, before generating any move, if a killer move, or a best move found in a transposition table, leads to a tree cut. In both cases we must ensure the move is pseudo-legal before generating the whole move list (because checking if a move is pseudo-legal is usually far faster than generating all moves).
Thanks for reading 😊
The text was updated successfully, but these errors were encountered:
fathzer
changed the title
Check if a move is (pseudo-)legal without generating the list of (pseudo-)legal moves
Check if a move is pseudo-legal without generating the list of pseudo-legal moves
Nov 8, 2023
It's been almost a year without a response, but we really should add these functions at some point. If anyone out there has the time and would be willing to help, I’d greatly appreciate it! Otherwise, I'll try to tackle it myself when I can find some spare time. :)
Hello,
Thanks a lot for this very impressive library, very useful for people like me, totally unable to understand how bitmap works 😉
I saw that the issue 5, 76 and 112 (related to board.isMoveLegal returning true for some illegal moves) are closed.
I wonder how I can check if a move is pseudo-legal without generating the whole moves list. If it’s not possible, may I suggest adding a method to do that?
Here is my use case: A classical tree search optimization is to check, before generating any move, if a killer move, or a best move found in a transposition table, leads to a tree cut. In both cases we must ensure the move is pseudo-legal before generating the whole move list (because checking if a move is pseudo-legal is usually far faster than generating all moves).
Thanks for reading 😊
The text was updated successfully, but these errors were encountered: