CCRL Discussion Board

Far better to address that question to 'the board' rather than to me, especially as writing/running code is not a topic for me (since about 1982). I believe that the 'last 16' are one disc and two courier trips away from eMule, so there's time for that before the vast majority of EGTs are promulgated.

Eugene Nalimov is presumed to have generated all 6-man EGTs, given that he has sent me the .tbs statsfile for KPPKPP. All but 16 3-3p DTM EGTs have been made available via Rob Hyatt's ftp site, and I know of four people who have (or will shortly have) all the published EGTs. They are being shared as...

I'm losing my touch: I wasn't looking at the dates

Any chance of a 'clean up' by deleting the old stuff here? g

Kyrill: the 3 3-3p EGTs you asked for haven't been published by Nalimov yet. Renze: the five EGTs Dan asks for I have you down as having, even pre the ftp work. You also provided MD5sums of them last week. Were these MD5sums a list you 'believe in' or MD5sums generated from your own copy of the file...

Seems like there can be 'issues' around eDonkey-generated eDonkey signatures for files. I don't understand why though. KK keeps a list of MD5sum checksums which are believed to be aok. I have proposed reference 'Data Assurance Certificates' (DACs) which would give: - MD5sum, eDonkey checksum and dat...

A search on 'kbpkbp' shows that:
- every one of the 7 EGT files has corrupted competitors in circulation
- there are 10+ presumably-ok versions and 4- presumably not-ok ones.

Terrific contribution - thank you: are you taking requests?

Thanks: should have thought to link back to the EDONKEY checksums on your project page.

In fact, I'm now seeing 5 sources of the ok file (3 @ 100%) and only 1 of the rogue file.

'AL AZMI' is the source of the rogue file - g

A search shows 1 complete source of one kqqnkn.nbb.emd file - and 6 incomplete sources of another.

Any views as to which is correct? g

... see response in the 'KNPKPP available' thread - g

This thesis investigates the use of Binary Decision Diagrams (BDDs) to see if they are a more compact and more efficiently-accessed way of storing chess endgame tables (EGTs). The compression results seem, on aggregate, to be no better than achieved already with Nalimov EGTs. The access-times do not...

Eugene has his 'travelling disc' and it is hoped that he will send it to John Tamplin soon with the 'remaining' 16 DTM EGTs: KBNKPP, KBPKNP, KBPKPP, KNPKPP, KPPKPP, KQPKBP, KQPKNP, KQPKPP, KQPKRB, KQPKRN, KQPKRP, KRBKPP, KRNKPP, KRPKBP, KRPKNP, KRPKPP These are presumed computed and verified, and co...

Would be useful if you could quote original sources on the 50-move rule. I've never heard of a 21-move rule. Heinz assumed a worst-case, 100% negative-correlation, at one point in his statistical analysis but didn't say so - and did not check the actual correlation. I assumed no correlation (but I d...

I'll put my proposals for p2p facilities another way: 1) I imagine that Kirill has compiled his statistics about the availability (sharedness) of the EGTs manually - showing whether an EGT can be found with 0, 1, 3 or 10 sources. Clearly, if one could specify a set of files one was interested in and...

OK, thanks for yr explanation and contribution. What your note rather points up is that there is no eMule system for indicating: - the typical availability of each of a set of files this knowledge might rather dictate download priorities plainly, KK canot be cycling round finding out how many X sour...

Kasparov is on record as saying that he likes EGTs because they teach him things. Better chess players than me can see pattern in the manoeuvres, even if these have not translated into rulesets for computers to use. There is a theory that the 50-move rule was created for the benefit of coffee-house ...

The new record shows a line where KQBN requires 330 moves (660 plies) to effect the first 'conversion', i.e., force-change and/or mate. In this case, the bB is captured. Thus, Black would have been able to _claim_ a draw after 50 moves on each side. Note however that the '50-move rule' is a 'rule of...

If by 'seeding' you mean 'sharing' which I think you do ... is there any need to tell us this. Doesn't the system just download from what sources it can see?

g

http://news.bbc.co.uk/1/hi/technology/4857306.stm

500GB per square inch - could be useful - g

No, Yakov's program is not available online. It's very much in R&D and pawnless mode, with Marc Bourzutschky doing the 7-man production running. So, we have single-P-endgames and multiple-P-endgames (with e.p.) to come yet. However, a new feature of EGT generation is that the EGT-verification is...

Maybe old news to EGTers, but I see that Marc Bourzutschky has found a new, 'deepest' endgame position using Yakov Konoval's superfast code. http://www.volny.cz/evcomp/tablebase.htm#330moves is the best source. Caveat: see the '2006-03 Summary' textfile in the CHESSBASE database for the full line, a...

I would like to thank Rafael for having the original 'Chessbase' krppkr.2.nbw checked out with datacomp for me. While some here have been kind enough to refer to me as an "EGT expert", the plaudit is somewhat misplaced today. It's usually me turning to Rafael, Marc B, Eiko Bleicher or John...

To clarify (?) what gambit3 is saying then: 1) the current Chessbase DVD for krppkr.2.nbw carries an ok file: good 2) the previous, flawed, krppkr.2.nbw passed datacomp tests and (somehow - not sure how) verifies as 'ok' in the absence of some of KRPPKR's subgame EGT files 3) therefore, it appears t...

I think Edwards' databases were DTM. KBBKN and KBNKN were published in the ICCA Journals: I didn't see evidence of others. Ken Thompson used DTZ for KRPKR and KQPKQ when he was pushed for RAM and did the endgames in slices, each slice corresponding to a subset of positions. http://www.is.reading.ac....

The metrics can all be given acronyms DTx where 'DT' means 'depth to (some event)' and x symbolises that event. It is assumed that the side with the win is minimising depth, i.e. the number of moves, to this event and the side facing the loss is maximising depth to that event. Thus: DTM == DT Mate D...