Search found 17076 matches
- Thu Jul 19, 2007 9:24 pm
- Forum: Computer Chess Club: General Topics
- Topic: Opteron versus Xeon
- Replies: 23
- Views: 8207
Re: Opteron versus Xeon
It would not be a nanoprocessor. A 16 nanometer "process" (not processor) doesn't mean the cpu is 16 nanometers in size. Think about it; you can easily see the cpu in your computer without a microscope. You didn't read what I wrote. I said a true nanoprocessor would use a 1 nanometer process, not 1...
- Thu Jul 19, 2007 9:20 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Where to put timeout() code in search?
- Replies: 14
- Views: 7397
Re: Where to put timeout() code in search?
Thank you Bob! I was sitting with my sketchblock trying to find out what I have to do in order to introduce search threads into Alaric and this didn't occur to me. I use setjmp/longjmp and you probably saved me a couple of hours debugging :D /Peter I used it very early in the Crafty development cyc...
- Thu Jul 19, 2007 9:18 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Checkers solved
- Replies: 16
- Views: 8606
Re: Checkers solved
Outstanding! Anyone know the technique used? From the BBC article, it could have been involved a Monte Carlo approach and/or pattern extraction from games. I wonder what Dr. Schaeffer will work on for the next 20 years? Ian It was based on endgame databases + a deep opening search. They finally com...
- Thu Jul 19, 2007 9:16 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Fruit and History Reductions
- Replies: 22
- Views: 12335
Re: Fruit and History Reductions
This is what it ment in Terra and still in Alaric: History Move Number: The move number in your ordered list of moves t this node. The moves after that are regarded as "late" in LMR (Late Move Reduction) History Treshold: You want to reduce "Late moves" (as above) but first you check that moves his...
- Thu Jul 19, 2007 12:04 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: caps->noncaps vs. goodcaps->noncaps->badcaps
- Replies: 22
- Views: 10198
Re: caps->noncaps vs. goodcaps->noncaps->badcaps
There are two ways to do MVV/LVA: 1) do all queen captures then rook captures .... 2) perform pxb before rxq I've tried both and 1 seems best. I think the reason for 1 working better than 2 is the same as putting bad captures before noncaptures. Every capture reduces the branch factor and capturing...
- Thu Jul 19, 2007 12:02 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Where to put timeout() code in search?
- Replies: 14
- Views: 7397
Re: Where to put timeout() code in search?
You could, but it isn't SMP safe, and time is not critical. An extra few microseconds unwinding a call stack won't be noticed..wgarvin wrote:Instead of returning up the chain you could use setjmp/longjmp, if you are able to clean up any temporary data structures used by search (repetition hash table or w/e).
- Wed Jul 18, 2007 11:29 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Where to put timeout() code in search?
- Replies: 14
- Views: 7397
Re: Where to put timeout() code in search?
because once abort is set, the value being returned in meaningless as it doesn't get saved anywhere...
- Wed Jul 18, 2007 11:29 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Where to put timeout() code in search?
- Replies: 14
- Views: 7397
Re: Where to put timeout() code in search?
Bob, can you point me at a section of code in Crafty where the old score is returned since the timeout was previously set? My search is *ok* with fixed depth but abysmal with time. It is in need of serious remediation. --Stuart When I back up something to the root, it is saved in the "triangular ar...
- Wed Jul 18, 2007 11:26 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: caps->noncaps vs. goodcaps->noncaps->badcaps
- Replies: 22
- Views: 10198
Re: caps->noncaps vs. goodcaps->noncaps->badcaps
There are two ways to do MVV/LVA: 1) do all queen captures then rook captures .... 2) perform pxb before rxq I've tried both and 1 seems best. I think the reason for 1 working better than 2 is the same as putting bad captures before noncaptures. Every capture reduces the branch factor and capturing...
- Wed Jul 18, 2007 11:24 pm
- Forum: Computer Chess Club: General Topics
- Topic: Opteron versus Xeon
- Replies: 23
- Views: 8207
Re: Opteron versus Xeon
It would not be a nanoprocessor. A 16 nanometer "process" (not processor) doesn't mean the cpu is 16 nanometers in size. Think about it; you can easily see the cpu in your computer without a microscope. You didn't read what I wrote. I said a true nanoprocessor would use a 1 nanometer process, not 1...