CCRL Discussion Board

On second thought, I wish you the best of luck on your forum. Goodbye.

Hi Ed. Can you provide further details? Without added details I have to say I'm extremely suspicious about your claims. Wow. The solution was so simple, I am surprised. It's called a PCI card with SATA II ports. Plug it in, bypass the SATA II on the motherboard entirely. I've already communicated t...

Now with chipset recall those who haven't got Sandy Bridge system yet will probably have to wait till March (or April). I got my MB just a day before recall (Gigabyte pulled all their boards from retail channels), so I am lucky perhaps. I'll probably send it for replacement later. Unfortunately 260...

The purpose of the test was to try and see if the time of 7:16 was "extraordinary" or not. OK Ed, I did the 3 consecutive tests, on the same Houdini 1.01 engine , but 32-bit and on my (lowly) Core 2 Duo @3GHz (2threads), 512 MB hash. 1st try: mate in 15 obtained in 26 minutes, at depth 31...

The purpose of the test was to try and see if the time of 7:16 was "extraordinary" or not. I have been dealing with superfast systems for so long, my friends have told me that I "should not complain" that it "took so long" to solve that mate in 15. After all, it's the s...

Small changes matter. In test #1, my system had been up and running almost 72 hours. It was hot, no doubt some of the RAM was fragmented, several program were open and had been running, and my browser had at least 15 tabs open. Therefore, as I quit some programs and launched Shredder, the allocation...

Well, look at the last two times. The difference is only 19 seconds. I don't see how that is all that great of a difference in time for such a hard position. I am wondering, how long does it take other computers to solve the mate? 20 minutes? 1 hour? Longer? I will test it on the i7-2600K I will be ...

Ok, I ran these tests: 1. Computer as is (browser launched, already on, then launched Shredder and loaded Houdini). 2. Restarted computer, cleared the hash table, Shredder would boot with Houdini as the engine. 3. Shut down the computer, let it cool down a few minutes, then repeated everything in te...

I think that is true for when you vary the hash table size, but once one thread reports a mate that is found, and updates the other threads, they should all "rush towards the goal" very quickly, unless the losing side finds a postponing move. I will do a few runs as you suggest and report ...

This mate in 15 was solved in 7:16 on my 3.9 GHz Intel Core i7-860 (the slowest computer I have). I am wondering, how long does it take to solve on other systems?

Unbelievably, the lowly i5-2500K @ 5.09 GHz was able to defeat the 5.27 GHz i7-980 extreme! And how do you explain that?... 4 cores better than 6 (at approx. the same GHz)??? The application runs on a single core and does absolutely no parallel processing. That means the one core it ran on while on...

Same thing has been reported with Gigabyte as well. Not even close. The ASUS incidents involved a continent-wide recall, and your "report" was one person making post after post after post on discussion boards claiming there was a problem, which he later admitted was an isolated incident. ...

Ok here is what I found. 1. Locate a copy of the tbgen program that generates any tablebases using his format. 2. Say you are examining king + rook + pawn vs. king + rook; make sure you have that file in the same directory as the executable. 3. Maybe you need to "hunt" for a few positions ...

Hi, I'm new to interfacing with the standard EGTB files, and I have tried to find information on how they (Nalimove) actually are structured but could not find any good source on that. What i'm actually looking for as a start is a command line interface to just probe a (one) position. Maybe that is...

I've been using ASUS for years, I'm perfectly happy with their products. I have one Gigabyte at the moment, that is fine as well. As alluded to previously, refer to this link: http://forums.aria.co.uk/showthread.php?t=46743 ASUS Maximus IV Extreme recall FYI... 2 members of a German forums have bee...

Hi Ed, interesting! I am also planning to build a 2600K-based system. That is really the way to go. I was using 2500Ks to "learn on", since they are so cheap (in case I ruined anything), but the learning curve is very flat and they are very easy to overclock (as well as the 2600K). I see ...

ASUS is a clear winner over Gigabyte in this review ASUS is, by far, the WORSE motherboard manufacturer. Their rate of RMA (returned merchandise) is so high, that many European resellers who also work with overclocking refused to use their equipment. You see, ASUS does not even make their own board...

Ed, let's solve the KRPPKRP only. How long do you estimate that would take? I am ready to give some funds for this calculation, and I am sure there are others. If we have still time, we should do the KBPPKBP, KNPPKNP, and lastly KQPPKQP. Sorry to be an absentee for so long. Was busy improving my sy...

Sorry for the long hiatus, I have been working on overclocking the new Sandy Bridge systems (which are amazing) and making my 5.0 GHz Gulftown even faster (it is at 5.27 GHz now, for 24x7 operation). I am hoping this is not "off topic", but as you can use such hardware to solve endgame tab...

Do you know of any public data comparing probing speed of different checkers programs / databases? My custom-tailored indexing functions and lookup routine is faster than the move generators in the game of checkers once a block is loaded into RAM. Therefore, the search speeds will not slow down whe...

Somehow you prefer to skip the slicing, and this intrigues me. Mostly subdivisions are avoided to create long "runs" for the "bitbases" in checkers. That is, the positions where we save only "win-loss-draw" information with no DTW. In checkers, every position with a ju...

Kirill Kryukov wrote:

Ed Trice wrote:That way, I don't have to make the tablebase more complicated. All of the positions where you castle are contained within the database.

How about those where the opponent hasn't castled either?

that too!

Kirill Kryukov wrote:I updated the 3x4 chess page with more data, particularly Zugzwangs and Value of the right to move may be interesting. Also the query interface is slightly improved.

What that page needs is some diagrams

I use a separate mini-table for all positions with en-passant or castling rights. I did not compute separate DTW for any positions where castling is legal. My querying program accepts castle flags as an input parameter, logically performs a castle, and checks the DTL (if it is still a loss) for the...

I think I understand now: You are probably talking about checkers-specific problem here. I haven't thought much about checkers, but when you can convert to almost any sub-endgame with a single move, probably it can complicate things slightly. :-) When solving checkers tablebases, you have to make o...