-
探索速度を向上させるため、SIMD命令による高速化を行う
以下は、参考になりそうな情報である。
https://memo.sugyan.com/entry/2022/07/08/002408
http://www.amy.hi-ho.ne.jp/okuhara/edaxopt.htm
http://www.amy.hi-ho.ne.jp/okuhara/bitboard.htm
-
Hello, thanks for this promising project.
I’ve a rust crate https://github.com/kraktus/rs-retroboard-chess that has sparked the interest of cpp users. I’d like to make it available.
The good thi…
-
-
Following instructions from the readme and emscripten, I get this error
```
stockfish.js git/ddugovic
❯ ./build.sh
Config:
debug: 'no'
sanitize: 'no'
optimize: 'yes'
arch: 'any'
bits:…
-
I don't really understand how bitboards work, so I have no idea how to know which piece I'm moving or which player it belongs to.
I would really appreciate a little explanation or adding a method t…
-
-
Right now the engine implements alpha-beta pruned search in the `chessengine.bitboard.Board` class. To help speed up the search, we should order the moves from most likely to be good moves to least li…
-
Since "all cards are equal" statistically, there is no need to shuffle up a new card for each new game. Random draws should be sufficient to get our statistics. This would improve performance substant…
-
Since this hasn't really been brought up before, I would like to suggest the possibility of Static BitArrays. In particular, since the performance of static arrays relative to regular arrays are so cl…
-
I want to get our Piece's attacking squares or get a square's attacking pieces. For example my knight on f3 and i want to take its attacking squares for example e5, g5... IS there any way to do this?