TalkChess.com

The design flaw therefore is at the leaf nodes when starting the Qsearch and there is a stand pat score >= beta. An illegal leaf move is not detected. How serious of a flaw is this? In QS, the side to move has a capture move to take the opposite king, which would raise the score to +infinity, i.e. ...

Why should that be necessary? Because the hashtable won't work with that many threads and exclusive access. The engine would spend all of its time waiting for the access right to be passed around. Splitting the hashtable into exclusive per-thread chunks won't work either because the hashtable is wh...

mclane wrote: ↑

Tue Mar 24, 2020 9:46 pm

So how do you want to judge this ?

Easy. Same hardware, same era, similar program development time - but Psion was already massively better than Glasgow in the first year where the main concern was to even get it working on the Mephisto platform.

Bringing out a commercial chess program in 1983 that has such a different method of Working is IMO a big success. Only that it was rapidly overtaken by others because AB did make a lot of progress in software, something that you usually deny. Glasgow's method simply turned out to be a dead end, whi...

MonteCarlo wrote: ↑

Tue Mar 24, 2020 8:44 pm

This can be conveniently confirmed by reading the definition of a "playout" on the same page you got the other definition from

Thanks for the hint.

Testing stockfish is a waste of time. It has no understanding about chess Just as LC0. Or do you really think that tons of linear algebra and playing games through until the end has anything to do with chess? Not understanding neural networks isn't an argument for fantasising human thinking into th...

I think it comes from the unfortunate definition of node for NN programs. But it does make them look clever. I guess it is kind of like Rybka nodes, which had *cough* a little fudge factor. Maybe I should only count nodes with White to move as printed nodes and label Black's moves just as "reply no...

LC0 running on the ARM cpu of my cheap tablet doing Arround 1-5 NPS plays very good chess. Match it against SF on the same tablet and see what happens. Besides, you're misinterpreting what a node even means for LC0. From the Github page: NPS: Nodes per second, including NNCache hits and terminal no...

You mean an array? let mut list = [Move; 256] Yeah something like that. I faintly remember that some traits are not implemented for such arrays above 32 elements. That is what I started out with, and assigning new memory over and over again in each instance of the function is brutally slow. Actuall...

The 6502 Ed Schröder used is faster. And it ran on 5 MHz. Thre's no way that a 6502 at 5 MHz is anywhere as fast as a 68k at 12 MHz. Not only because of the clock frequency, but the 6502 is an 8 bit processor while the 68k is 32 bit internally (with 16 bit data bus). OK, the language is there - MM5...