Search found 145 matches

by sedicla
Tue Mar 27, 2012 11:55 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: When does a cut-node became an all-node?
Replies: 64
Views: 7578

When does a cut-node became an all-node?

According to chess wiki programming is when after all candidate moves are tried, but fruit does it after first move is tried. I thinking of trying doing things differently according node type, for example: cut-node - use static null move (like stockfish) and don't do razoring (eval + margin < beta)....
by sedicla
Fri Nov 11, 2011 4:33 pm
Forum: Computer Chess Club: General Topics
Topic: Google AI Challenge 2011
Replies: 16
Views: 3641

Re: Google AI Challenge 2011

I'm using C. Using the path finding a*, and the strategy is basically defend my hill, attack enemy hills and look for food. The rest of ants I make them move straight then around obstacles. Also when finding an enemy I check if i will die if I move, in this case I move back. I'm using C. It is inter...
by sedicla
Thu Oct 13, 2011 2:29 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Dennis M Ritchie, RIP
Replies: 21
Views: 4194

Re: Dennis M Ritchie, RIP

A very long time ago :wink:, I leaned to program in C. From all languagues I learned, Pascal, Basic, VB, Progress, java, assembly, C#, C++, the most entertaining is still C. I always admire Mr Ritchie for bringing us the C language.

printf("RIP C man!!!\n");
by sedicla
Wed Sep 28, 2011 2:58 pm
Forum: Computer Chess Club: General Topics
Topic: Human vs computer
Replies: 16
Views: 2714

Re: Human vs computer

For me the man vs machine in chess is pretty much the same comparison of man vs car racing. Usain Bolt can't beat a car in a race by foot. We accept that and still we have interessting man only and car only competitions. I think computer chess is going to be the same. Soon would be just impossible t...
by sedicla
Tue Sep 27, 2011 4:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Internal Iterative Deepening questions
Replies: 12
Views: 3723

Re: Internal Iterative Deepening questions

I understand, seems the research is not necessary anyways.
I'm using the mvv/lva in the sort.
by sedicla
Tue Sep 27, 2011 4:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Internal Iterative Deepening questions
Replies: 12
Views: 3723

Re: Internal Iterative Deepening questions

Regarding opening the window, I was not saving any move in the hash table if I failed low. That's why I researched again with open window to force a best move. However now I'm doing some tests to save the best move even if it fails low. In the end I think I really don't need to research. But from wh...
by sedicla
Tue Sep 27, 2011 1:50 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Internal Iterative Deepening questions
Replies: 12
Views: 3723

Re: Internal Iterative Deepening questions

So, if I understood correctly I can use IID for non-pv in order to skip some bad moves to be searched, something like this: // Internal Iterative Deepening. if (hash_move == MOVE_NONE && depth > 3) { if (pv_node) { // for pv_nodes look for a good hash_move. score = search_a...
by sedicla
Thu Sep 22, 2011 2:04 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Internal Iterative Deepening questions
Replies: 12
Views: 3723

Re: Internal Iterative Deepening questions

The first test didn't show any improvments. I think I'll keep the way it is. I guess if you are on depth = 10 and call IID with depth=3 you have a hash_move of depth = 3. But if you call with depth - 3, then you eventually have a hash_move of depth=7 which probably is a better move than of depth=3. ...
by sedicla
Wed Sep 21, 2011 2:06 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Internal Iterative Deepening questions
Replies: 12
Views: 3723

Internal Iterative Deepening questions

Usually IID is implemented like this: if (hash_move == NONE && depth > 3 ...) search (alpha, beta, depth - 3, ... Has anyone tried searching with depth = 3 immediately, like: if (hash_move == NONE && depth > 3 ...) search (alpha, beta, 3 , ... I'm testing it now with 1000 games, 10sec+0.1sec. Doesn'...