Search found 16741 matches

by bob
Wed Jul 25, 2018 3:01 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Time Management and Move Selection
Replies: 14
Views: 2986

Re: Time Management and Move Selection

I think you need to give up on "easy move" itself. Leads to problems. What if your opponent finds a deep tactic that lets it hang a piece, but it takes a deep search to realize this? Easy move code can make you do the capture and get blown out. There are things you can try, with risks. For example, ...
by bob
Fri Jul 20, 2018 4:09 am
Forum: Computer Chess Club: General Topics
Topic: how will Leela fare at the WCCC?
Replies: 176
Views: 19993

Re: how will Leela fare at the WCCC?

one famous one was a limit on number of processors, were the limit was completely arbitrary and announced at the last minute. Never understood that and it was eliminated the next year...
by bob
Wed Jul 18, 2018 8:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI Hash Usage Rules
Replies: 60
Views: 7509

Re: UCI Hash Usage Rules

VM usage has never been real accurate. It is quite difficult to determine what is duplicated and what is not. And that answer changes as the program executes and causes copy-on-write duplications. And then there is the shared memory stuff if you use processes. Looks like each process is huge when in...
by bob
Tue Jul 17, 2018 12:57 am
Forum: Computer Chess Club: General Topics
Topic: how will Leela fare at the WCCC?
Replies: 176
Views: 19993

Re: how will Leela fare at the WCCC?

Couple of points... There has been a solution for this. If program A offers a draw ITSELF, that is supposed to be passed on to program B, IF it can process the request. Then no human intervention is possible. The idea is that a program should be able to play a completely legal game of chess all by i...
by bob
Tue Jul 17, 2018 12:40 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI Hash Usage Rules
Replies: 60
Views: 7509

Re: UCI Hash Usage Rules

I don't quite follow what that "threads are more resource heavy under linux." In fact, it is the exact opposite. Threads intentionally share everything, where processes (via fork()) share very little (at least they share executable code and anything that is not modified - an artifact of the "copy o...
by bob
Mon Jul 16, 2018 3:41 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI Hash Usage Rules
Replies: 60
Views: 7509

Re: UCI Hash Usage Rules

I am quite sure that the memory usage per thread is real, but probably it came with the OS, threads are more resource heavy under Linux. This might be one of those cases that sometimes even the author may not know the engine is behaving absurd under certain circumstances. If a user does care much a...
by bob
Sun Jul 15, 2018 3:44 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI Hash Usage Rules
Replies: 60
Views: 7509

Re: UCI Hash Usage Rules

Interesting issue. Since I doubt I will ever do a UCI version of Crafty, I really don't have a dog in this hunt. But I do tend to agree that there are three parts to a chess program that are of interest. (1) basic program + basic blocks of memory required to make the program functional. IE bit board...
by bob
Mon Jul 02, 2018 7:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: What am I missing with respect to MTDf
Replies: 6
Views: 1557

Re: What am I missing with respect to MTDf

I think you probably have a couple of issues. One is an evaluation that has a lot of terms and a wide scoring range, which makes it very difficult for MTD(f) to stabilize within a couple of tries, so that it becomes more expensive. The second is that the way you implement the convergence is also pre...
by bob
Mon Jul 02, 2018 7:25 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: sscanf question
Replies: 4
Views: 1032

Re: sscanf question

I also prefer strtok() as it makes it simple if you want to re-parse something with different delimiters. IE if you notice a "/" you might want to re-parse with that to deal with FEN, where in other cases you might not want "/" to be a delimiter (I use "/" for time control settings for example... An...
by bob
Fri Mar 23, 2018 4:17 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: I'm not very happy with the do {} while() statement in C
Replies: 111
Views: 25223

Re: I'm not very happy with the do {} while() statement in C

Little endian is a retarded design that came due to backward compatibility with the original 8 bit architecture. Many machines have done it right (big endian). Little endian has one important property, fetching smaller integer from the same address. This is the reason why BE sucks and why LE is act...