New answers tagged

3

Build a cache. You're exposing yourself to endless transposition. Please don't shuffle your moves. I don't have the numbers but I doubt randomly shuffle all your lists can be quick. It's O(n). I fail to see how it can address your repetition anyway. Double check your generator. Source code is not here, so I have no idea I don't know what exactly your table ...


1

Computing magics at statup is fine because it's done only once and not very slow. https://github.com/official-stockfish/Stockfish/blob/master/src/bitboard.cpp // init_magics() computes all rook and bishop attacks at startup. Magic // bitboards are used to look up attacks of sliding pieces. As a reference see // www.chessprogramming.org/Magic_Bitboards. ...


2

There is an API for this now at following url: https://uschessapi.azurewebsites.net/api/player/{Id} In this case {Id} = USCF Member Id Following is an example request/response: Request - https://uschessapi.azurewebsites.net/api/player/13197795 Response(JSON) {"memberId":"13197795","name":"JEREMY KRASIN","regularRating":"1828","quickRating":"1818","...


4

I have every reason to believe your approach is wrong and will lead to disaster. I'm saying it as someone who make softwares to work on Polyglot books (www.smallchess.com). You are strongly advised NOT to do all the hard works like what I did before. Just wrap the C++ Polyglot code in your C#! Your time should be on your C# engine, not this. Polyglot, ...


3

Stockfish is a free project, people don't work for financial returns. Unfortunately, that would mean your request might never be honoured. As a programmer with technical skills, you are expected to compile the code yourself. Sorry, this is how a free open source project work. They give you the code for free, so you just have to do some works.


Top 50 recent answers are included