TalkChess.com

konsolas wrote: ↑

Sat Feb 16, 2019 11:31 am

Not storing draw scores in the transposition table seems to work for me, though I question how this will affect strength in other areas of the game

In what order do you test for repetition versus checking the transposition table? Does that make a difference?

Chase rules are a convoluted mess, because they are largely defined by precedent rather than a clear-cut rule. At least in my opinion.

With that caveat, the fact that there exists a SEE-neutral exchange after Hd4 says, to me, that this is indeed not a chase.

What he means is that you can use a strong engine (say Stockfish) to simulate a much weaker opponent by allowing it to think only a tiny fraction of the time a truly weak engine would have had to think. It would save you nearly half the CPU time during test games if the opponent would move 100 time...

Jazz and SjaakII should be in that range. You should probably also grab FairyMax (or microMax, I suppose it doesn’t really matter if you’re only interested in normal chess). Might I suggest though that you use something like Stockfish or Komodo at time odds? You want to spend. CPU time on your progr...

From what I recall, tablebase generation is generally I/O bound, not CPU bound. A tablebase generator typically uses an algorithm like this: 1. Allocate a bitlist for all possible positions 2. Mark all “lost” positions 3. Retro-move from all positions found in 2/5: these positions are “won”. 4. Retr...

Bad naming of commands, like hard/easy to means pondering on/off is a much major flaw that makes many programmers (including me) to flee away from the winboard protocol. Well, “hard” means “switch the engine to hard difficulty”, which implied that it would ponder, in some old version of GNU Chess. ...

There also is little need to do it, because Larry Kaufman already did it for us, and shared the results. ok I get that but why Rofchade get pieces value like those then const eval pieceValue[2][6] = { 82, 337, 365, 477, 1025, 12000, 94, 281, 297, 512, 936, 12000 }; Why not use 100 as MG pawn value ...

i have no problem writing code to handle the UCI interface for now, in fact the only thing i wrote in my engine for now is the UCI parser. Which lead me to my current problem. Writing a UCI parser in Fortran isn’t the main issue (although I never found Fortran string manipulation particularly conve...

I worked with Fortran for about ten years, up to a few years ago. Mainly for floating point calculations though, I never really used its bitwise operators, but I seem to recall they’re overly verbose. Fortran’s main strengths, as I see it, are its array block operations and auto-parallelisable loops...

I think you can do better by testing for alignment first, and only then doing a lookup for the actual piece (your xxxAttacksBB functions) if there is alignment. You probably also want to do that in a ray-direction way, rather than by full rank/file/diagonal. You can cache the attack information for ...