-
So far, the game logic / rules of chess are not yet fully implemented.
I think it would help to have one place to track all rule violations that have been found so far, because not all of them are …
zzril updated
2 years ago
-
since piece list wasnt sorted it was changing during perft since pass by reference in java, ie quick fix for perft in mean time ArrayList pieces = (ArrayList)piecesArr[i].clone();
cant quite think o…
-
Hi David,
ich stolperte nur zufällig über Deinen Beitrag, und ich bin daran interessiert, um als Anfänger in Sachen NNUE meinen einfachen Schach-Bot in C auch mit einer NNUE-gestützten Bewertungsfunk…
-
Love the package! It would be really cool if we could adjust the board size to either 8 or 10, since draughts is also commonly played on 8x8 boards.
-
Hi, i've had a play around with this and I find a way to search moves quicky.
I just tried the following to enumerate moves:
static void Main(string[] args)
{
var gam…
-
The evaluation function is too weak, compared to variants of compactness.
I suggest you implement a (slow) eval func that computes compactness as closely as you can to Tino Werner's description. B…
-
Hi,
I ran into an issue using BitboardHelper.GetPawnAttacks(Square square, bool IsWhite).
Shortform:
The result of `BitboardHelper.GetPawnAttacks(new Square("b4"), false)` == 21474836480 == c5 …
-
.SquareIsAttackedByOpponent() generates the mask of attacks everytime you call it, which is slow, which creates a problem.
There should be a way to cache an attack mask and use it in the same positi…
-
Currently, `eval::get_score` takes in a `Board` and `num_legal_moves`. This is ugly and the code is not readable.
This could be fixed by moving `num_legal_moves` into the `Board` struct and have it b…
-
This can be seen in https://pacoplay.com/game/5080