Search found 1041 matches

by Ras
Mon Apr 27, 2020 9:29 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Javascript/WASM Engine with permissive license
Replies: 9
Views: 1157

Re: Javascript/WASM Engine with permissive license

There is a GarboChess 3.0 in the CCRL 40/15 list , rated 2587/2537 (64bit/32bit). But I guess these are not the JavaScript versions. This is likely the C++ version. The tomitank Github repo (JS engine under GPL3) says that pure JS is 5 times slower than C. If we assume 60 Elo per doubling, that's 1...
by Ras
Mon Apr 27, 2020 7:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Dirty hashing trick
Replies: 15
Views: 1721

Re: Dirty hashing trick

You just accept that it confuses position with and without castling rights that are otherwise the same, on hash probes. Almost never happens anyway, and if it does, so what? Nearly the same here, except that I verify the hash move for pseudo legality, including castling rights if the move is castli...
by Ras
Mon Apr 27, 2020 7:35 pm
Forum: Computer Chess Club: General Topics
Topic: New engine: Stash
Replies: 84
Views: 13653

Re: New engine: Stash

mhouppin wrote:
Mon Apr 27, 2020 4:03 pm
(excluding NG-Play that seemed to refuse to boot)
You could try my bugfix version 9.87b; binaries for Windows are included:
https://www.ct800.net/download/NGplay_9.87b.zip
by Ras
Sun Apr 26, 2020 8:51 pm
Forum: Computer Chess Club: General Topics
Topic: Sapeli 1.0 - New chess engine
Replies: 137
Views: 41483

Re: Sapeli 1.0 - New chess engine

Does something different work better in your engine? It doesn't have winning/losing captures because there's only MVV-LVA, no SEE. PV move, hash move, null move threat, and quiet killers get a priority adjustment. Quiet moves that aren't killers are ranked by history, and if there is none, just mov...
by Ras
Sun Apr 26, 2020 6:22 pm
Forum: Computer Chess Club: General Topics
Topic: New engine: Stash
Replies: 84
Views: 13653

Re: New engine: Stash

I also noticed that self-Elo tests should not be used all alone to evaluate a gain in performance (as shown by the versions 13 and 14, where the gain expectations were +120 and +100 Elo and eventually came around the +60 Elo That's pretty OK actually - as a rough rule of thumb, the real Elo gain is...
by Ras
Sun Apr 26, 2020 11:47 am
Forum: Computer Chess Club: General Topics
Topic: Compile of Sashimi engine
Replies: 17
Views: 1562

Re: Compile of Sashimi engine

I think it's ridiculous I have to load Rand as a dependency Maybe it's security geeks taking over. They often want to outright ban simple, but insecure PRNGs out of fear that someone just might accidentally use them for cryptographic purpose. In the domain Mozilla is working, that would be plausibl...
by Ras
Sat Apr 25, 2020 6:57 pm
Forum: Computer Chess Club: General Topics
Topic: Compile of Sashimi engine
Replies: 17
Views: 1562

Re: Compile of Sashimi engine

like package managers in general because they indeed make installing software and using dependencies easy. Which is why they at least exacerbate the problem they are trying to solve. However, most of the problems should vanish by themselves because Rust direly needs to stabilise both as language an...
by Ras
Sat Apr 25, 2020 10:20 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 41
Views: 3105

Re: Simplifying code

Then one can increase reduction to make trees smaller as much as you like. The whole idea of move ordering is to make the trees smaller without sacrificing move quality. That's not only in plain alpha-beta, but even more so with pruning because you want to just prune random moves, only the probably...
by Ras
Sat Apr 25, 2020 9:36 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 41
Views: 3105

Re: Simplifying code

Henk wrote:
Sat Apr 25, 2020 9:27 am
The nodes near the root need not care much about efficiency of move ordering.
I don't think so. True, there are only few nodes near root, but they have the largest search trees beneath them.
by Ras
Sat Apr 25, 2020 8:59 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 41
Views: 3105

Re: Simplifying code

I am quite sure that hash move first only ordering does not make for a very good move ordering scheme. Correct because most of the time, at least in the middlegame, there won't be a hash hit. But I guess you could also implement MVV-LVA in some clever way so that the order of move generation would ...