CCRL Discussion Board

A curiosity: I generated also knnnkb and I found that there is one position (Ka1, Nh1, Nb3, Nh8, kc2, bg8) in the wtm file where white wins in 96 moves! Guido Hi Guido! In KBNNKN you will find checkmate in 109! (I collect longest checkmate positions on this page ). :-) Hi Kirill, Thanks for your in...

Hi Josh, Hey that is really great you attempting to generate these 5-1 files. For my personal self Josh as I explained in previous postings I am only interested in the *.tbs stat files. Thank you so much for giving this a go and whenever you find time send me the *.tbs stat file. Looking forward to ...

Hi Josh and vb4, All is very strange! I tried to send the stats 3 times to vb4 and once to Josh, but I never received an answer, so I decided to put them here in an attachment. The file stats.txt contains 15 stats files of 5-1 TBs. Unfortunately I don't use the same format of Eugene Nalimov, so it c...

[quote="vb4"]Hi Josh, I think my comments were directed to Guido. I am not sure what happened maybe I screwed up <S>. Anyway Guido posted not to long ago that he has run a few of the 5-1 egtbs and I was inquiring about him sending me the stat files. Sorry, Les [quote="jshriver"] ...

Anyone know what the longest mates are in the 3piece set? particularly kqk, and if so what is it's fen and solution. -Josh kqk (wtm) win in 10 moves - 1 only position : Ka1 Qb2 kf5 krk (wtm) win in 16 moves - 121 positions: Ka1 Rb2 kc3 and other 120 ... kpk (wtm) win in 28 moves - 3 positions: Ka2 ...

Good Morning, *stretch* I put that on the backburner till I finish my queue of other project. the FEG generator seems to crash on me after a couple days of running so I'm not sure what's wrong. It doesnt take much effort to set it up to run. But since there's no programs I know of to access 5-1 FEG...

The 'sticking point' is having the right code to generate 5-1 index-schemes, including code for '(4) men of a kind'. I don't know how generic Nalimov's 'like men' code is. Marc B is the expert on indexing-schemes as on all other things, and has I believe collaborated with Eugene Nalimov on the 3-3p...

[DW: EN may relay the EGTs via one of our colleagues shortly. Meanwhile, Marc may convert more of 'the 16' to EN form in his own time. Not ETAs. I've collated MB FEG.lof stats with EN.tbs stats with 100% alignment as expected.] Knocking out 'unreachable' positions completely, afaik, is an unsolved ...

An exchange between a 'Guy' and a 'Guido' must be a rare thing ... When Pawns feature, and only the a-h symmetry applies, stats from various programs should agree - after (as with FEG.lof stats) dividing by 2, 4, 6 or 12 as necessitated by 'like pieces'. It is difficult to impossible to compare Nal...

Dear Guido, since I start a 3-week vacation tomorrow, let me reply briefly. 1) 8.1 MB is the current size (in RAM) of my computation of kqpkrn There is no swapping going on, as I have 24 GB of RAM. 2) I am using version 3.4.5 of gcc. "Internal compiler error" is probably not due to a prob...

Eugene Nalimov sent me his kppkpp.tbs file, August 2005. He did not share the actual EGT files with anyone. I also have .tbs files for 3 other unpublished EGTs - see above in this CCRL thread. There are 16 unpublished 3-3p EGTs, the only EGTs missing from the 'wanted' 3-6-man set (as 5-1(p) is of l...

Hi Josh, since the computer I am using belongs to my research project at the university, I will probably not get the Intel compiler for free. If you suceed in compiling a faster executable, I'd be very interested. I used the command g++ -O3 -o tbgen tbgen.cpp Of course, structuring the code into pa...

Trying to figure out how many permutations there are in a given endgame. Say for example you have KNPknp would you calculate that as 64!/(58! * 1! * 1! * 1! * 1! * 1! * 1!) = 53,981,544,960 possible positional variations. 64 total squares, 58 empty squares and 6 unique pieces. Another exmaple KNNkn...

Hi Guido, I have computed two more endgames on my 3.4GHz Pentium 4 (2 GB RAM): kbbkbb took 5 hours, kbbknn took 17 hours. The second one was computed with a different method implemented by Eugene Nalimov which he calls "bit vector algorithm". Ciao, Martin Kreuzer Hi Martin, Thank you agai...

Hi all, some infos on the status of the new compilation of Eugene Nalimovs TB generator: 1) The code can generate 6-men endgame tablebases. 3) I have updated my profile, so you can send me a request for the code or the executables if you are interested. (I am also easy to find via google.) 3) Over ...

Pls may you record execution time and memory used for each 6-men TB generated by you (and the PC you use)? I'm the author of another TBs generator (see the thread "Semi-new egtb format") and in this time I'm generating 6-men TBs, so these data can be very ineteresting for me. Moreover I c...

Hi all, after fiddling with the code a bit, my student and I have been able to compile it using g++ under linux. The file tbdecode.h from the crafty souces needs to be renamed tbdecode.c There were a number of further compiler error messages due to the difference between g++ and the ms compiler Eug...