Search found 18624 matches

by hgm
Fri Oct 19, 2007 9:00 am
Forum: Computer Chess Club: General Topics
Topic: Disambiguation of moves
Replies: 9
Views: 2375

Re: Disambiguation of moves

OK, thanks for the input. The problem is that the current Winboard parser seems to recognize both upper and lower case for the piece-type designator. I can easily change that to recognize upper case only, but 'd rather not do that, as whole groups of engines that work under Winboard now, might cease...
by hgm
Fri Oct 19, 2007 8:03 am
Forum: Computer Chess Club: General Topics
Topic: Disambiguation of moves
Replies: 9
Views: 2375

Disambiguation of moves

In changing Winboard for handling fairy pieces I encounter the following conceptual problem for the move parser: [d] 8/8/8/8/B7/8/BP6/8 w - - What does 1. b2b3 mean here? Is it a pawn move? Or is it Bb3, (=Ba2-b3) with a 2 as disambiguation character to distinguish it from B4b3 (= Ba4-b2). And what ...
by hgm
Fri Oct 19, 2007 7:49 am
Forum: Computer Chess Club: General Topics
Topic: Fairy-Max 4.8 released
Replies: 26
Views: 8938

Re: Fairy-Max 4.8 released

Any idea of when you will release Winboard_F? Very soon, I hope. There still are some loose ends that I have to tie up. Like allowing a wider variety of piece-indicating letters in FENs in such a way that they are passed to the engine as they occur in the FEN, rather than being determined by the Wi...
by hgm
Thu Oct 18, 2007 9:46 pm
Forum: Computer Chess Club: General Topics
Topic: Fairy-Max 4.8 released
Replies: 26
Views: 8938

Fairy-Max 4.8 released

Note I just released a derivative of uMax that can handle (almost) arbitrary fairy pieces, and board sizes upto 12x8 (and as a result can play Capablanca Chess): http://wbforum.vpittlik.org/viewtopic.php?t=6880 A sample game, played under Winboard_F: [Event "Computer Chess Game"] [Site "FOM-RHKA8J2A...
by hgm
Thu Oct 18, 2007 1:12 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: What is the best known speed of move generation?
Replies: 109
Views: 48954

Re: What is the best known speed of move generation?

Yes, this is what I meant when I said that the normal rookAttacks would not do, and you would need a 14-bit variety (with 2D magic). You would need a variant that does pay attention to the edge occupancies, and if the entire ray is empty upto and including the edge, does not include it in the attack...
by hgm
Wed Oct 17, 2007 9:45 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: What is the best known speed of move generation?
Replies: 109
Views: 48954

Re: What is the best known speed of move generation?

Since we may have multiple sliders but only one king, the other way around requires a loop over all potential pinners (as suggested by Jacob) - or directionwise fillstuff with multiple sliders. Are you sure? Why would it matter if you get an attacks set with multiple rays set? Even if all 4 orthogo...
by hgm
Wed Oct 17, 2007 4:57 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: What is the best known speed of move generation?
Replies: 109
Views: 48954

Re: What is the best known speed of move generation?

The cost is relatively small, but it is a same permanent small loop overhead with several table lookups again and again. It may (or may not dependent to compiler optimizations and other random factors) be slightly faster then pseudo-legal generation, but I cannot accept the given pin implementation...
by hgm
Wed Oct 17, 2007 4:48 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: What is the best known speed of move generation?
Replies: 109
Views: 48954

Re: What is the best known speed of move generation?

Adding the critical "in perft results" to the above sentence. programs that dislike pins because of mobility evaluations will do something early in the tree to get rid of the absolute pin deeper in the tree... If they can. The other program will of course do its best to maintain the pin, if only be...
by hgm
Wed Oct 17, 2007 4:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: What is the best known speed of move generation?
Replies: 109
Views: 48954

Re: What is the best known speed of move generation?

With magic bitboards you get orthogonal checks by getting rook-attacks from king-square to intersect it with opposite rooks/queens. Dito with bishop-attacks and the diagonal sliders. r = rookAttacks(occupancy, kingSquare); if ( r & oppositeRooksOrQueen ) // in check What I meant was that yo...
by hgm
Wed Oct 17, 2007 4:14 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: What is the best known speed of move generation?
Replies: 109
Views: 48954

Re: What is the best known speed of move generation?

rnb1kbnr/ppppqppp/8/8/8/8/PPPPQPPP/RNB1KBNR w KQkq - (Opening, both queens pinned) 1. 24 8 33.33% 2. 547 191 34.92% 3. 13629 4416 32.40% 4. 336781 104837 31.13% 5. 9109498 2495648 27.40% 6. 246238592 61779149 25.09% Wow! That is way more than I expected. I pinned both Queens so that I would...