Search found 43 matches

by DustyMonkey
Fri Jul 26, 2019 12:08 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Coverity Scan
Replies: 9
Views: 2065

Re: Coverity Scan

coverity search for security vulnerability in your code That's not entirely correct. They also find dead code, null pointer dereferencing and tons of other things. One mans "dead code" is another mans "old version of the eval" or "known to be bug-free alphabeta" Yes these are things you wouldnt wan...
by DustyMonkey
Sat Jul 13, 2019 4:52 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A pre-calculated pawn hash table ?
Replies: 28
Views: 3141

Re: A pre-calculated pawn hash table ?

The examples you give are STILL ones where the game is heading towards a non-draw result. It doesnt matter which side is winning. Well, so don't give him an extra Queen but an extra Rook. Point is that differences in piece material, like the exchange, Rook vs 2 minors, Bishop pair vs B+N can always...
by DustyMonkey
Fri Jul 12, 2019 4:50 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A pre-calculated pawn hash table ?
Replies: 28
Views: 3141

Re: A pre-calculated pawn hash table ?

You cannot guess the game outcome from the Pawn structure. A Pawn structure can be awful, like two isolated Pawns aganst 6, where 4 of the latter are connected passers. But if the side with the 2 Pawns is a Queen ahead, it would still be a trivial win. However bad a Pawn structure, it can always be...
by DustyMonkey
Thu Jul 11, 2019 6:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A pre-calculated pawn hash table ?
Replies: 28
Views: 3141

Re: A pre-calculated pawn hash table ?

Food for thought:

Pawn structures where a player has a "bad" formation maybe arent important to cache because the "elo cost" of the "extra work" might be made up for by the fact that one side already has a "bad position" and the game is likely already heading towards a non-draw result.
by DustyMonkey
Wed Jul 10, 2019 2:34 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Are there any benchmarks for LC0 on the new AMD 7nm GPUs?
Replies: 9
Views: 1312

Re: Are there any benchmarks for LC0 on the new AMD 7nm GPUs?

AMD bet on OpenCL but it "lost" so its no wonder their investment in it became sketchy. Their OpenCL 1.0 SDK would seamlessly mix CPU and GPU which was what I was after early on, as I had one of the first 6 core consumer chips available (The Thuban line of Phenom II processors) - this was when the n...
by DustyMonkey
Mon May 13, 2019 7:49 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: One idea to solve chess?
Replies: 35
Views: 8623

Re: One idea to solve chess?

EGTB's are desirable because they are FAST. The classic Time vs Space tradeoff. NN's are not even close to optimal models of any domain. Not even close. Keep that in mind, that its not even close. Let me say it again, that it is not even close. Very far from optimal. So very far. Let me say it again...
by DustyMonkey
Sat Feb 02, 2019 7:14 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: So, how many of you are working on neural networks for chess?
Replies: 22
Views: 3743

Re: So, how many of you are working on neural networks for chess?

I think still NN engines even on higher-end commercial graphics cards play blunders at a pretty high rate. Its not the NN evaluation that is the problem. Its the monte-carlo tree search, and it cannot be solved with tweaks to the evaluation or the monte-carlo tree search. The solution is to stop us...
by DustyMonkey
Wed Nov 28, 2018 10:42 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Java: white ? repeat : repeat;
Replies: 31
Views: 3620

Re: Java: white ? repeat : repeat;

I did not think it was possible in C# to do it. (forgot this part) Intrinsics in .NET have been a long time coming for sure. It is still not official, and I wouldnt be all that surprised if it takes several years for finalization of any of it. Thats just how Microsoft rolls. Once upon a time they w...
by DustyMonkey
Wed Nov 28, 2018 10:01 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Java: white ? repeat : repeat;
Replies: 31
Views: 3620

Re: Java: white ? repeat : repeat;

Doing that together with favouring captures a lot (that could be merged in a similar fashion maybe) will lead to much better play where the engine will learn by itself. One nice property will be that generating an opening database will be very easy and you would actually more or less steal the open...
by DustyMonkey
Wed Nov 28, 2018 9:45 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Java: white ? repeat : repeat;
Replies: 31
Views: 3620

Re: Java: white ? repeat : repeat;

Go on an embarass me by making Portfish run as fast in C# as SF3 in C++. Dream on. You wrote this. That tells me a lot. You seem to overrate IPO/whole program optimization. How many conditionals in performance-critical loops will be optimized away? None. Then the programmer manually did it. Get it ...