TalkChess.com

Sven wrote:using the pgn tag would be an improvement :-)

done

Arminius games [pgn] [Event "ICS rated blitz match"] [Site "winboard.nl"] [Date "2017.10.28"] [Round "-"] [White "Arminius"] [Black "Floyd"] [Result "1-0"] [WhiteElo "1887"] [BlackElo "1595"] [TimeControl "300+1"] [Annotator "10. +0,56"] 1. d4 d5 2. c4 e6 3. Nf3 a6 4. cxd5 exd5 5. a3 Nf6 6. Bg5 h6 7...

rpiArminius games: [pgn] [Event "ICS rated blitz game"] [Site "212.114.110.107 5000"] [Date "2017.10.28"] [Time "21:01:00"] [Round "-"] [White "nemorino"] [Black "rpiArminius"] [WhiteElo "2039"] [BlackElo "1722"] [TimeControl "5+1"] [Mode "ICS"] [Result "1-0"] 1. e4 e6 2. d4 d5 3. Nc3 Nf6 4. e5 Nfd7...

Don't forget that it is HGM who organizes these tournaments and it has to match his timing requirements.

Arminius from startpos and depth 17: Positions from qsearch were not counted. Positions with hash cutoff, null move cutoff, draw by repetition, mate and stalemate were also not counted.

Unfortunately compact is not the same as cache friendly. But compactness is much easier to optimize. When you have a access to a linux machine you may want to examine different lookup tables with cachegrind. For what its worth, here are my most compact white magics. uint64_t lookup_table[88772]; str...

Since you have the infrastructure to test these things, would you be able to test one variation for me? (((occ & mask) * magic) + 0x8000000000000000ull) >> (64 - n) That gave me a lookup table of size 90995*8. The sizes for the most compact per square tables without overlapping are 4767*8 for bisho...

OK, now I finally understand the point. So it's a micro-optimization that will not change anything in practical terms for chess programming, but it's somewhat entertaining for some people as a challenge. It was intended to get a smaller table, but since the size of the table does not drop significa...

How did you come to the idea of using black magics? Was it already used in Hermann or more recently tried in Arminius? There were three things that came together for the idea. 1st I recently installed openSUSE 64 bit on my raspberry pi 3 and I wanted to test how fast my magic generator is on that m...

Let's look at the smallest example from my magics found, a bishop on square 9 (usually this is b7, but possibly also b2, g2 or g7). The mask for this sqare is 0x0040201008040000. With index = ((occ | ~mask) * 0x083e3ee040080801) >> 55 we get an index in the range {488..504}. With index =...