-
Several languages (including C and Rust) would allow for efficient bitboard implementations. These should probably be separate from the array-based implementations.
-
-
Create Magic Generation for magic bitboards
-
As stated in issue #2, right now the performance bottleneck is the RNG. Once that is fixed, the bitboards should be replaced with counters to improve performance.
An array of counters per card can …
-
hi,
i successfully compiled your v0.1 into a Linux binary and it runs fine in CuteChess !
btw. your previous Trappist asset binary did NOT run, i couldn't use it ..
Blaze plays rather weak (sti…
-
-
Hey, I cant seem to compile it, I ve tried including and changing some of the code but I am unable, how do you compile it properly?
g++ -o out.o chess_engine.cpp position.cpp tables.cpp types.cpp
…
-
## Advantages and disadvanges
Advantages:
- SSE
Disadvantages:
- Potentially using too much memory
## API
The only possible candidate is:
```rust
#[repr(C, align(16))]
pub struct Bitboa…
-
https://youtu.be/_vqlIPDR2TU?t=1357 its an interface like in this video i want
-
i just found your pet chess engine app .. i'm trying to compile it on Linux (Xubuntu 22.04) but it fails .. however, i found some info to fix it.
first i had to adjust some Cmake file, because the …