Search found 284 matches

by Sesse
Sat Jan 02, 2021 12:20 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: YBW engines past and present?
Replies: 15
Views: 3222

Re: YBW engines past and present?

Dann Corbit wrote:
Thu Dec 31, 2020 2:55 pm
Did you try LazySMP?
Easy as falling off of a log and seems to work really well.
It's insane that seemingly small tweaks to what was considered the worst-scaling algorithm (shared hash table) somehow produces the best one.
by Sesse
Wed Dec 30, 2020 10:39 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Blunder option
Replies: 37
Views: 5578

Re: Blunder option.

Ferdy wrote:
Wed Dec 30, 2020 7:48 pm
Ajedrecista wrote:
Wed Dec 30, 2020 12:01 pm
What is j in

Code: Select all

F(i) = Prob(i) + SUM[Prob(j)], with j < i
j is all integers from 0 to i-1, inclusive. So F(i) is cumulative probability.

So F(3) = Prob(3) + SUM[Prob(j)] = Prob(3) + (Prob(0) + Prob(1) + Prob(2)) = Prob(3) + F(2).
by Sesse
Wed Dec 30, 2020 10:22 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Compiler Speed Nowadays
Replies: 22
Views: 3135

Re: Compiler Speed Nowadays

Ras wrote:
Wed Dec 30, 2020 4:37 pm
I also find debuggers mostly useless, except for rare cases such as a buffer overflow that overwrites something else which crashes later in an unrelated part of the code.
For buffer overflows, ASan is extremely useful. (It's mostly replaced Valgrind for my uses.)
by Sesse
Wed Dec 30, 2020 10:21 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Compiler Speed Nowadays
Replies: 22
Views: 3135

Re: Compiler Speed Nowadays

I'm not a fan of invasive log/printf spamming => you have to modify the code, build and clean it up afterwards (ok, trivial with git, but still completely unnecessary). I don't see how it's superior to non-invasive debugging. it's not just about stepping, like I said - data access breakpoints/condi...
by Sesse
Wed Dec 30, 2020 11:12 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Compiler Speed Nowadays
Replies: 22
Views: 3135

Re: Compiler Speed Nowadays

Had some issues with this in the past because GNU linker needs a specific linking order (reverse order of dependencies). If you don't want to sort your dependencies topologically, you can use linker groups. Or the hackish way of specifying everything twice :-) Of course, this will be slower, but LL...
by Sesse
Wed Dec 30, 2020 11:10 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Compiler Speed Nowadays
Replies: 22
Views: 3135

Re: Compiler Speed Nowadays

The only thing I'm missing on Linux is a good C/C++ IDE. VS (despite the insane amount of bugs) is so far the best IDE out there. Tried CodeBlocks, CLion, QtCreator, XCode on Mac, nothing comes even close. Did you ever try VSCode? (I know it's the same only in name, but it seems to be popular on bo...
by Sesse
Tue Dec 29, 2020 11:23 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Compiler Speed Nowadays
Replies: 22
Views: 3135

Re: Compiler Speed Nowadays

Joost Buijs wrote:
Tue Dec 29, 2020 4:43 pm
To be honest I have the feeling that development tools under Linux are so cumbersome compared to Visual Studio that I don't want to step away from it.
As a Linux user who sometimes has to use Visual Studio, I can assure you, the feeling is mutual :-)
by Sesse
Tue Dec 29, 2020 5:37 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Blunder option
Replies: 37
Views: 5578

Re: Blunder option

I am currently working by multipv. Make your engine as strong as possible so that its multipv is more reliable. There is no need to make the engine weaker by weakening its eval, search etc. This is the most common way (e.g. Stockfish does it, and also the Play Magnus app), and it generates pretty u...
by Sesse
Tue Dec 29, 2020 1:59 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Blunder option
Replies: 37
Views: 5578

Re: Blunder option

As with pretty much any other engine I've seen, the blunders are just not very believable. It's a really hard problem. E.g., I played 1. d4 d5 2. c4 Nf6 3. Nf3 Bd7 4. e3 h5 5. Nc3 a5 6. a4 Ra6 7. cxd5 [D]1n1qkb1r/1ppbppp1/r4n2/p2P3p/P2P4/2N1PN2/1P3PPP/R1BQKB1R b KQk - 0 7 From here, the engine playe...