Search found 748 matches

by Desperado
Tue Sep 15, 2009 9:15 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI engine authors: Please add support for 'searchmoves'
Replies: 85
Views: 10055

Re: UCI engine authors: Please add support for 'searchmoves'

But one question is left for me now, i dont know the expression "stateless protocol", what does that mean exactly ? A "stateful protocol" (the opposite of a stateless one) means that the protocol presumes your engine has some state (like the a board position, a game history, the clocks) and that it...
by Desperado
Mon Sep 14, 2009 5:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI engine authors: Please add support for 'searchmoves'
Replies: 85
Views: 10055

Re: UCI engine authors: Please add support for 'searchmoves'

- deosnt support ucinewgame (definitely) ucinewgame was added to the UCI protocol a long time after the specification was published. It's perfectly OK for a GUI to not use it and still claim UCI support. You cannot write a GUI to support things which aren't even specified yet! Likewise it's never n...
by Desperado
Mon Sep 14, 2009 1:42 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI engine authors: Please add support for 'searchmoves'
Replies: 85
Views: 10055

Re: UCI engine authors: Please add support for 'searchmoves'

... It's not the GUI authors' role to interpret the UCI standard. That's the role of the engine authors. ... That is simply not true!. As example i want to mention a GUI that i love as chessplayer,but dont like very much as engine-author. The all known Chessbase-GUI is a perfect example. - doesnt s...
by Desperado
Wed Sep 02, 2009 6:12 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fast approach to detect attacked squares?
Replies: 16
Views: 4072

Re: Fast approach to detect attacked squares?

Hi, I've just started working on a chess engine in C#, and I've come across a snag in my move generation. I was wondering what a fast technique is to detect which squares are attacked and by which side. The most simple method I can think of is *almost* generate all the moves for the other side. Tha...
by Desperado
Sat Aug 29, 2009 7:39 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Generating "through" attacks with rotated bitboard
Replies: 16
Views: 2390

Re: Generating "through" attacks with rotated bitb

My point was, if you have developed your engine over years, and you are happy with rotated bitboards, all is running fine and smoothly, and you concentrate on lowering branching factor and smarter search and eval, you are probably not that interested to eventually speed up in the < 1% range, with t...
by Desperado
Sat Aug 29, 2009 1:47 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Generating "through" attacks with rotated bitboard
Replies: 16
Views: 2390

Re: Generating "through" attacks with rotated bitb

PS: (last post) ... I only proposed OD (as buildup), ... Changing those aspects is much more work than replacing the pure attack-getter api. It is more error-prone for very little gain, if any. That means, i dont want to replace something, i think it is cheap enough to have it as additional utility(...
by Desperado
Sat Aug 29, 2009 1:17 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Generating "through" attacks with rotated bitboard
Replies: 16
Views: 2390

Re: Generating "through" attacks with rotated bitb

Hi Gerd, well it s comprehensible, the way you argue. But my only itention was to note, that there is a possibility to become aquainted with another bitboard approach without writing anything from scratch . _At the end_, someone will (should!) decide for one approach(avoiding any kind of overhead), ...
by Desperado
Sat Aug 29, 2009 7:06 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Generating "through" attacks with rotated bitboard
Replies: 16
Views: 2390

Re: Generating "through" attacks with rotated bitb

Obviously, the superior algorithm is much simpler with non-rotated approaches. No rotated discrimination intended ;-) Cheers, Gerd Hi again, i think so too, and maybe it is not necessary to write everything from scratch. Maybe you can easily make a buildup with Obstruction difference approach. I th...
by Desperado
Sat Aug 29, 2009 5:02 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Generating "through" attacks with rotated bitboard
Replies: 16
Views: 2390

Re: Generating "through" attacks with rotated bitb

Hi Vlad, just a question about your data structures. 1. I think that you already have masks at hand,like filemask,rankmask, diagmask,antimask ? do you ? (excluding square in question) a. are the masks easy to split in lower and upper part ? b. or can you invest 4k mem to add such lo and hi masks ? e...
by Desperado
Thu Aug 27, 2009 6:41 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: New Architectures in Computer Chess
Replies: 54
Views: 9289

Re: New Architectures in Computer Chess

Hi Robert, i dont know anything about FPGA configurations (programming) (sorry :) ) I will add that a "multiply" is not exactly FPGA-friendly since it doesn't have an intrinsic instruction set. So you would get to design a finite state machine to do that multiply, at the point where you need it, whi...