Search found 7057 matches

by Uri Blass
Thu Jun 07, 2007 10:19 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Revisiting Check Extensions
Replies: 18
Views: 12979

Re: Revisiting Check Extensions

of course there is something better than always extending full ply
but I do something different.

I do not extend checks when the side that gives the check had a big material advantage before giving the check.

Uri
by Uri Blass
Thu Jun 07, 2007 10:04 am
Forum: Computer Chess Club: Tournaments and Matches
Topic: Deep Junior - Deep Fritz: Game 2: 1/2 - 1/2
Replies: 4
Views: 2237

Re: Deep Junior - Deep Fritz: Game 2: 1/2 - 1/2

[Event "Fritz vs Junior Match"] [Site "Elista"] [Date "2007/6/7"] [Round "R1 G2"] [White "Deep Junior"] First game Junior was white Is there a rule that Junior is white all games? Another question is if you can give the full game because the game is not finished in the final position and toga see a...
by Uri Blass
Thu Jun 07, 2007 6:21 am
Forum: Computer Chess Club: Tournaments and Matches
Topic: Movei does NOT know how to mate with a King and Rook
Replies: 13
Views: 4385

Re: Great performance of Movei423 in fast time control

Engine I believe that Uri should offer this last version to the public before going Commercial, it has been a long time since the last version 403 was offered to the public. To me this version is almost as strong as Wildcat in fast time control, but it also plays FRC or Chess960 :wink: This is with...
by Uri Blass
Wed Jun 06, 2007 7:57 pm
Forum: Computer Chess Club: General Topics
Topic: It is official now: 2002 ELO with 1961 characters!
Replies: 33
Views: 13611

Re: It is official now: 2002 ELO with 1961 characters!

Hello Harm, congratulations! MicroMax improves very quickly, in a few years it probably will beat Rybka :lol: Your code is really small, even my small engine pikoSzachy (picoChess) is giant comparing to it. Current version of piko (2.1) has the size of source code 25781 bytes, and not yet finished ...
by Uri Blass
Wed Jun 06, 2007 6:46 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Observator bias or...
Replies: 51
Views: 57680

Re: Observator bias or...

Yes, for this reason testing at a fixed number of nodes and recording the ime, rather than fixing the time, seems preferable. Fixing the number of nodes doesn't make any sense to me. Lets say I make a mod that quadruples the NPS. If the number of nodes searched is fixed then the program reaches the...
by Uri Blass
Wed Jun 06, 2007 6:42 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Observator bias or...
Replies: 51
Views: 57680

Re: Observator bias or...

search a fixed number of nodes, record the results. Make any change to the program you want. Search a fixed number of nodes and the results are absolutely useless to compare with the first run. Is that hard to understand given the data I provided above? What is hard to understand is why the results...
by Uri Blass
Wed Jun 06, 2007 4:13 am
Forum: Computer Chess Club: Tournaments and Matches
Topic: Movei does NOT know how to mate with a King and Rook
Replies: 13
Views: 4385

Re: Movei does NOT know how to mate with a King and Rook

This is not correct. Movei certainly knows to do it with tablebases or at longer time control but I admit that it should not happen even at fast time control Here is some analysis by movei423 You can see from the main line that with enough depth search movei see pushing the king to the corner. I thi...
by Uri Blass
Tue Jun 05, 2007 10:33 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hamsters randomizer in action
Replies: 28
Views: 15130

Re: Hamsters randomizer in action

hgm wrote:But do you make the move if it leads to a node that will give you a pruning hash hit? Joker doesn't, as it probes the hash before making (normal) moves.
Movei today does not use hash for pruning.
I will try to change it in the next month.
by Uri Blass
Tue Jun 05, 2007 9:42 pm
Forum: Computer Chess Club: General Topics
Topic: 2 new entrants: 2007 World Computer Rapid Chess Championship
Replies: 5
Views: 2738

Re: 2 new entrants: 2007 World Computer Rapid Chess Champion

I may enter in case that I find an operator with faster hardware.

I bought My A3000(2.01 ghz) in 2004 and I do not think that it is fast enough.

Uri
by Uri Blass
Tue Jun 05, 2007 9:25 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Comparison data of Crafty vs Rybka that I promised 2 days ag
Replies: 27
Views: 18548

Re: Movei added to Crafty vs Rybka comaprison data

I think that the main advantage is better detecting of bugs. It is possible that the search is simply not symmetric between white and black not because of not symmetric order of moves but because of a bug and you do some pruning for white when you do not do it for black. It may be possible to see th...