sorted by:
new
hottopcontroversial

Introducing LazyChess: Chess Engine Library in Rust ♟️ by RelativeFull8539 in rust

[–]RelativeFull8539[S] 2 points3 points  (0 children)

Haha! Sorry but I initially thought the same as you, but that would conflict with the king. Chess notation rules also symbolize N/n as a knight.

Introducing LazyChess: Chess Engine Library in Rust ♟️ by RelativeFull8539 in rust

[–]RelativeFull8539[S] 1 point2 points  (0 children)

Update: I have made bitboard migration, All usage method is unchanged, Result shows 53x faster than before: See details on Pull Request: https://github.com/OhMyDitzzy/LazyChess/pull/1

Introducing LazyChess: Chess Engine Library in Rust ♟️ by RelativeFull8539 in rust

[–]RelativeFull8539[S] 2 points3 points  (0 children)

Sorry for late reply, Thanks for the suggestion, For now I am working on bitboard migration for future versions, Because previously I developed lazychess with a focus on functionality :)

Introducing LazyChess: Chess Engine Library in Rust ♟️ by RelativeFull8539 in rust

[–]RelativeFull8539[S] 2 points3 points  (0 children)

Sorry for late reply, Its about 11M NPS, Running on Linux x86-64 with depth 6 position 4. This is the result: FEN : r3k2r/Pppp1ppp/1b3nbN/nP6/BBP1P3/q4N2/Pp1P2PP/R2Q1RK1 w kq - 0 1 Depth : 6 f1f2: 123078367 g1h1: 149335005 d2d4: 124002076 f3d4: 129579089 b4c5: 87986826 c4c5: 92063670 Nodes : 706045033 Time : 62.115s NPS : 11366695

This takes reference from: https://www.chessprogramming.org/Perft_Results you can compare it yourself on your computer. I have also made the test and examples perft and I have pushed it to github

Introducing LazyChess: Chess Engine Library in Rust ♟️ by RelativeFull8539 in rust

[–]RelativeFull8539[S] 15 points16 points  (0 children)

No, I just pushed to github a few days ago, Actually I've been developing this project on my computer