Search found 16848 matches

by bob
Wed Jun 27, 2007 12:57 am
Forum: Computer Chess Club: General Topics
Topic: What is faster for endgame tables
Replies: 35
Views: 14547

Re: What is faster for endgame tables

Hi Pax, I am using a 8GB usb Memory stick (flash, no minidrive). Acess time very fast (0,7) from transcend - jetflash 160. All tbs 1-5 men fit on it. The acess is very good. I can see no more low nps with Shredder 9 e.g. I agree ! Until now there is no HDD and/or technology which is better (faster)...
by bob
Sun Jun 24, 2007 11:54 pm
Forum: Computer Chess Club: General Topics
Topic: What is faster for endgame tables
Replies: 35
Views: 14547

Re: What is faster for endgame tables

RAID 0 array will not perform as fast as an solid state drivequote] That is in theory. In reality raid0 murders solid state drives, because they are all using things like FLASH memory which is ridiculously slow. Yes, if you had a large DRAM disk (Cray Research builds them but they are not cheap) th...
by bob
Sun Jun 24, 2007 5:02 pm
Forum: Computer Chess Club: General Topics
Topic: What is faster for endgame tables
Replies: 35
Views: 14547

Re: What is faster for endgame tables

it really isn't _that_ noisy. I have a bunch of 15K drives in my office machine, and while it is not whisper quiet, it isn't worse than a small refrigerator I also have in my office...
by bob
Sun Jun 24, 2007 5:00 pm
Forum: Computer Chess Club: General Topics
Topic: What is faster for endgame tables
Replies: 35
Views: 14547

Re: What is faster for endgame tables

RAID 0 array will not perform as fast as an solid state drivequote] That is in theory. In reality raid0 murders solid state drives, because they are all using things like FLASH memory which is ridiculously slow. Yes, if you had a large DRAM disk (Cray Research builds them but they are not cheap) th...
by bob
Sun Jun 24, 2007 6:27 am
Forum: Computer Chess Club: General Topics
Topic: Glaurung wrong mate scores
Replies: 10
Views: 3623

Re: Glaurung wrong mate scores

It seems that glaurung's evaluation is too high in the following position and it see mate scores at small depth(when the depth is big enough it can see the draw) New game - Rybka 2.3.2a 32-bit [D]8/6kR/8/8/8/bq6/1rqqqqqq/K1nqnbrq b - - 0 1 Analysis by Glaurung 2-epsilon/4: 1...Qc2xh7 = (0.00) Depth...
by bob
Sun Jun 24, 2007 6:25 am
Forum: Computer Chess Club: General Topics
Topic: What is faster for endgame tables
Replies: 35
Views: 14547

Re: What is faster for endgame tables

Raid 0 has a huge drawback, if one of the hard drives die, you lose all your data. The best choice would be RAID 5 with 5 hard drives, 6 would be ideal. This will give you a similar performance of a RAID 0, or at least a close performance to RAID 0 without the worry of losing data when one of the h...
by bob
Sun Jun 24, 2007 3:25 am
Forum: Computer Chess Club: General Topics
Topic: What is faster for endgame tables
Replies: 35
Views: 14547

Re: What is faster for endgame tables

gigabyte137 wrote:I remember seeing it before but I can't find it.... Raid 0 (2) Seagate 320Gb drives or some kind of flashdrive or usb jumpdrive? Overall performance which is better for endgame tables and only endgame tables? Thanks...
raid-0 by a _large_ margin...
by bob
Sat Jun 23, 2007 10:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: DTS and the call stack
Replies: 21
Views: 8979

Re: DTS and the call stack

Crafty uses the YBW type approach, which is still pretty good at choosing split points since we have to search one move at a node before doing any parallel searching. Most of the time if I get a fail high, it is on the first branch, meaning that the YBW approach does pretty well overall. But one th...
by bob
Sat Jun 23, 2007 3:47 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: DTS and the call stack
Replies: 21
Views: 8979

Re: DTS and the call stack

Remember I am not doing a full DTS since I kept my recursive search for simplicity reasons. So once A splits with B, C and D, there is no way the tree can be split anywhere _above_ that split point, since nobody can search there until the split point has been finished. So everyone works below that ...
by bob
Sat Jun 23, 2007 3:37 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: En Passent
Replies: 5
Views: 2907

Re: En Passent

En passant doesn't have anything to do with the search. En passant is a part of your move generation and once it's done you don't have to worry about it in your search. You really need to separate the different parts a chess engine consists of before moving on... I know you got the same advice when...