TalkChess.com

Occam's razor says that we should first look for the simplest possible explanation. And the simplest possible explanation is that Lazy has almost zero overhead. The overhead is so small, that (combined with a few primitive tricks to avoid that threads do too much double work) it wins against (some?...

mclane wrote: ↑

Sun Dec 22, 2019 6:10 pm

Why ? Who cares if there is a progress of 40 ELO ?

There will be no progress in computerchess by this kind of programming.

Buy a computer twice as fast and use the old version. Will bring more ELO.

Nonsense. Stockfish brilliant project is Communism 2.0 in real actual action.

The loose screws are the ones that make the step progressions. Unfortunately for the loose screws, for every ten thousand of them, or more, only one does actually something the world eventually recognises as useful, or overthrows some prior theory or whatever. The question is, does the world deserv...

I guess another step would be to abandon the tree search completely and handle it by the neural network alone.... -- Srdja That will probably will never happen, as search is about tactics instead of strategy. First you need a function approximator that is more accurate than SEE which I think curren...

I don't believe, that You can learn to play without the rules of the game :D . Not possible. Well, it does get the rules of the game told to it, but not in a conventional manner. And it doesn't "learn" the rules in any sort of conventional manner either. It doesn't really learn chess, it creates an...

I don't believe, that You can learn to play without the rules of the game :D . Not possible. Well, it does get the rules of the game told to it, but not in a conventional manner. And it doesn't "learn" the rules in any sort of conventional manner either. It doesn't really learn chess, it creates an...

William Herschel: Because no one else was making mirrors of the size and magnification desired by Herschel, he determined to make his own.[43] This was no small undertaking. He was assisted by his sister Caroline and other family members. Caroline Herschel described the pouring of a 30-foot-focal-l...

Ah! I thought this was a philosophical discussion about approaching some perfect database (map) for everybody to use. But it turns out to be about a database of your games plus a chess engine to operate on the leaf nodes in the database, at the time of meeting them, and dependent on what your oppon...

This argument requires time travel. Not really, because I don't need to have a chess map for all the positions I'll need in my life, when an opponent makes a move, I'll know what position I need, because I'm seeing it, so I just need to build the part of the chess map that I need to rank the best m...

very good, only another universe-full-of-atoms positions to go. Wake us up when we're approaching the next big bang, and tell us how you got on. But why? As I said, I only need the top ranked move of all positions that I'll play in my life, and those can easily fit in under 1TB. I don't need anythi...