Search found 811 matches

by elcabesa
Mon Apr 09, 2012 7:42 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: futility pruining, razoring question
Replies: 33
Views: 7797

Re: futility pruining, razoring question

I'm reading again and again the whole post nad I'm rather confuse. :-) let's see if I could summarize everything I have read about Razoring just after Qsearch (if depth<=0) and TT testing i could try to razor the search. There is Razoring (cutting if score <alpha) and static null move pruning or eva...
by elcabesa
Wed Apr 04, 2012 6:21 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: futility pruining, razoring question
Replies: 33
Views: 7797

futility pruining, razoring question

I was trying to implement some new feature inside my engine and I can't make futility and razoring work inside my engine.

Today I have noticed that Cheng engine does futility and razoring only inside Null Windows search, is this approach correct??
by elcabesa
Fri Jun 03, 2011 6:04 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Which perft result is correct (and why)?
Replies: 31
Views: 5460

Re: Which perft result is correct (and why)?

another example could be the following:

in the isAttacked(BitMap &targetBitmap, const unsigned char &fromSide) function, commenting

Code: Select all

//if &#40;slidingAttackers&#41;
give the program a 1% speedup
by elcabesa
Fri Jun 03, 2011 5:08 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Which perft result is correct (and why)?
Replies: 31
Views: 5460

Re: Which perft result is correct (and why)?

Hmmmm, you have programmed perft as a single thread (me too). My engine's perft 6 takes 11.7 seconds, running on an i3 M330 (2.13 GHz), which is only slightly slower than yours (not a factor 2). - bitboards - magics for ranks, files, and diagonals (so I need 4 multiplications for a queen) I'll have...
by elcabesa
Fri May 13, 2011 4:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Which perft result is correct (and why)?
Replies: 31
Views: 5460

Re: Which perft result is correct (and why)?

hi, I used another one method to minimise makemove/unmakemove error the move generation. probably my method is not the fastest ( i don't know). Each position need not too much byte to be reapresented, so I have an array of position, when i start searching i start from array[0] and and every time i d...
by elcabesa
Fri Apr 22, 2011 8:33 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Writing a chess program in xx steps
Replies: 8
Views: 4239

Re: Writing a chess program in xx steps

i'm just reading it and finding some good idea :)
by elcabesa
Fri Jun 18, 2010 12:38 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: automatic tuning of parameters
Replies: 2
Views: 753

automatic tuning of parameters

do you know if there are any tool that can be used to automatically tune engines parameters?

or should i create a tool for myself? I'd like to try something like a genetic algorithm
http://en.wikipedia.org/wiki/Genetic_algorithm

thank you in advance
by elcabesa
Fri Jun 18, 2010 6:30 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: search speed
Replies: 6
Views: 1301

Re: search speed

it's a

Code: Select all

if&#40;depth==0&#41; return 1;
program.

i know the other one is faster, but I think i implemented it this way to get a legal move generator.
Maybe it's possible to implement it the other way
by elcabesa
Thu Jun 17, 2010 6:22 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: search speed
Replies: 6
Views: 1301

Re: search speed

1) i only make domove and don't do unmake, a game is an array of position so unmake move is somethink like "index--;"
2) my code doesn't have any kind of hashin/caching/transposition till now


sharper is a very very fast c++ cengine
by elcabesa
Thu Jun 17, 2010 11:58 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: search speed
Replies: 6
Views: 1301

search speed

writing my own c# chess engine I'm now trying to speed it up. my program is written in c#, can't use any assembler optimization( pospolation count etc) , is 32bit, use bitboard, no magicbitboard, no hashtable, lookuptable for knight & king, shift for pawns. on my 2 years old pc my perft function can...