-
Civilization 4 has a concept called plotgroups, which tells if cities are connected to resources. I implemented the same in Medieval Conquest, except it only spreads through roads. The system is that …
-
today i won 3 games against ElephantGambit
the first game was a hard struggle .. in the end ElephantGambit just gave me a full Rook for nothing, so i won that game .. how could this happen ?
 provides an efficient way of almost lossless mapping from a position to `u64`. This is required for several important things:
- Ca…
-
Zobrist hashing is a hashing technique used in board game algorithms, particularly in game-playing programs like chess engines. It was introduced by Albert Zobrist in the 1970s as a method to efficien…
-
Zobrist hashing and cache caused 10x slowdown. Check why.
-
Hi, I made a change to my engine, which is just a shakmaty upgrade https://github.com/princesslana/princhess/pull/155
But on running an sprt test with cutechess, I get the following results:
```
…
-
Hello.
Interested in using your pytorch wrapper of `baspacho` for solving multiple Ax = b problems (as opposed to least squares). I can see tests using `SymbolicDecomposition`, but I don't understa…
-
## 対象になりそうなもの
- Zobrist Hash (`zobrist.ts`)
- (もし導入するのなら) BitBoard
## なぜ必要か
- JavaScript のビット演算子は数値を32ビット整数に変換し、それを超える範囲は切り捨てられる [1][2][3]
- このため、正しいハッシュ値を求めることが出来ない場合がある [3][4]
- Zobrist hash…
-
This one-way hashing algorithm apparently can reduce a board position to 64-bits with few collisions.
https://www.chessprogramming.org/Zobrist_Hashing