Search found 131 matches

by Pio
Tue May 26, 2020 10:04 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: This is strange ?
Replies: 3
Views: 187

Re: This is strange ?

I have found that in one game, my program locked up when it reaches depth = 11 in the iterative search. If I change the first block of code to the second block it then works ??? But the code gives the same logic/conditions ??? (I'm using Free Pascal). Have I missed something ? (the indenting has be...
by Pio
Sun May 17, 2020 7:29 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: How do you fix this.
Replies: 11
Views: 542

Re: How do you fix this.

I'm listening :?: I think your problem could be that you maybe only look for 3-folds in the search path from your current position. You should look back in the history of previous moves until a pawn push, a capture or a castling has taken place since those are irreversible. If this is the problem y...
by Pio
Sun May 10, 2020 9:57 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft speed optimization (renamed)
Replies: 86
Views: 5396

Re: Perft speed optimization (renamed)

So... a big part of the refactor has been finished. The code is now much cleaner. (The refactor allowed me to remove several forwarding functions and references-to-references.) It did gain some speed, but not too much: Startpos7 is now consistently in the lower 77.x range. KiwiPete6 is now consiste...
by Pio
Tue Apr 14, 2020 8:04 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Canonical Position Representation
Replies: 52
Views: 2446

Re: Canonical Position Representation

I use my dense representation for everything. I do not have any other structures except a static 10x8 board helping move generation and for seeing if a piece moves out of bounds. I only do copy make so no unmake is needed. I do not have white and black. I have side to move and not side to move. The...
by Pio
Mon Apr 13, 2020 10:55 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Canonical Position Representation
Replies: 52
Views: 2446

Re: Canonical Position Representation

Hi, I store my board in 192 (3*64) bits (see my post http://www.talkchess.com/forum3/viewtopic.php?topic_view=threads&p=538593&t=49575 how I do it). The nice thing with my representation is that it is simple, compact, can represent all possible chess positions (and all impossible ones as long as th...
by Pio
Mon Apr 13, 2020 9:28 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Canonical Position Representation
Replies: 52
Views: 2446

Re: Canonical Position Representation

Gentlemen (regrettably, I am afraid there are no ladies present), Recently I have been experimenting with move generation from dense piece lists, and noticed that an arbitrary position (assuming no RB-promotions) may be stored in 256 bits (128 per side) as a whole (STM, castling and e.p. included)....
by Pio
Sat Apr 11, 2020 3:28 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: magic bitboard perft
Replies: 24
Views: 1713

Re: magic bitboard perft

I release a new perft program based on magic bitboard: https://github.com/abulmo/MPerft I just provide the source code and a makefile. To compile it from a unix like terminal just type 'make pgo' on the command line or 'make pext' if you have a recent intel cpu (unfortunately I just have a ryzen cp...
by Pio
Mon Apr 06, 2020 10:38 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: The devilish fail low
Replies: 34
Views: 1990

Re: The devilish fail low

Indeed it seems never good to spend a much different time as your opponent. Even if the opponent thinks much faster or slower than what is objectively optimal, you should at least partly (perhaps as much as 80%) adapt to him, rather than stick to the ideal schedule. As to reductions: these only man...
by Pio
Mon Apr 06, 2020 9:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: The devilish fail low
Replies: 34
Views: 1990

Re: The devilish fail low

That's reasonable, but it doesn't address my question. The PV with the bad score is at depth 24 in this example because that's how far you need to look ahead to even see the looming problem. The point is that in the reduced search the lines that were reduced to (say) 6 ply can already be seen to be...
by Pio
Sat Apr 04, 2020 9:26 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: FEN and 3rd repetition rule. No information?
Replies: 46
Views: 2653

Re: FEN and 3rd repetition rule. No information?

Total bullshit. That an engine is UCI does not mean it implements MultiPV or searchmoves. Most UCI engines in fact don't. And some CECP engines do. In Dutch we would say: "Je lult uit je nek!". Random changes because of the butterfly effect do not count as an effect of the protocol. Especially if t...