TalkChess.com

Could you post an image about this "black windows"? Did you use the exe or the py file? I built the exe using pyinstaller. It's the standard Windows console, or if you prefer the command prompt. I cannot take a screenshot because it just appears during a fraction of second. Probably it is the conso...

The confusion maybe comes also from the fact that I gave a link to another file without saying clearly what was the difference or the similitude with the file proposed by MikeB. Sorry for that. If you are interested, you can see here the function that I used to number positions. See the function Pos...

Beautiful. I like very much the design.

After some user actions, a black window appears. It's (I imagine) when a script is started. Isn't there a way to hide these black windows? If it isn't possible I can live with it.

Good continuation! I will follow this project with interest.

On the FR stuff, just not interested in doing any UI around it mainly right now so not sure the point to add fen position numbers to PGN. Anyone know by the way if you even did add a fen position to PGN is there a PGN tag for that? I guess i'm wondering how custom this all is. Are there any agreed ...

A short version, with only white pieces.

It could be useful but without more user feedback to gauge interest I didn't think it was worth getting into release one of Pulsar with Chess960. But pulsar chess engine with chess 960 is in release now at https://apps.apple.com/us/app/pulsar-chess-engine/id839640447 for iOS and https://play.google...

Sven wrote: ↑

Sun Jun 16, 2019 4:24 pm

Iterative deepening is a concept one level above the tree search itself. The latter can be implemented recursively or iteratively.

Thank you for your code. I will study it.

Hello! Here is Alouette 0.0.6 . Some quick and dirty results, with very short time controls (Cute Chess option "tc=40/40"). Standard variant: Rank Name Elo + - games score oppo. draws 1 Belofte 0.9.0 63 89 83 40 69% -101 13% 2 Alouette 0.0.6 7 64 62 72 58% -53 6% 3 Alouette 0.0.5 0 62 60 72 57% -50 ...

but in the current state of the program there is no provisional best move, to be returned when the 'stop' command is received. I have to think how I will make that. The typical solution for this problem in classical chess engines is iterative deepening: the engine performs a search to depth 1, 2, 3...

When I look at alouette.pas, the parser for the "go" command is not really implementing the UCI spec. The order of arguments is not specified, but you rely on it in utils.pas. Also, the case where wtime, btime, winc, binc AND movestogo is given seems to be missing. I'd suggest that you do a WordPre...