Author: Dann Corbit
Date: 04:25:27 12/31/01
Go up one level in this thread
On December 31, 2001 at 06:31:02, Michel Langeveld wrote: >On December 31, 2001 at 05:28:54, Dann Corbit wrote: > >>On December 31, 2001 at 05:26:11, Michel Langeveld wrote: >>>I want to check how efficient Nullmover is. >> >>By how often you fail high on your first choice. > > >This is with internal iterative deepening off. The following was without but >WITH iterative deepening however: > >DATA: > total nodes................................ 12230155 > eval nodes................................. 8266510 >QSEARCH DATA: > qsearch calls.............................. 5832765 > nodes generated by qsearch................. 2441207 > total qsearch nodes........................ 8273972 > % of nodes in qsearch...................... 19 >NULLMOVE DATA: > nullmove starts............................ 79077 > nodes after nullmove....................... 9420739 > qsearch calls after a nullmove............. 2759399 > nodes generated by qsearch after a nullmove 1441173 > total qsearchnodes after nullmove ......... 4200572 >MOVE ORDERING: > total moves played......................... 12151077 > beta cutoffs............................... 1649876 > times first moves was best................. 1547049 > % of the firstmove beta cutoff............. 93 > betaCounterNth............................. 1883882 > average betaCounterNth..................... 1.142 >HASH: > hashRecords................................ 6010068 > hashProbes................................. 9788947 > hashHit.................................... 2665587 > >The % of the firstmove beta cutoff is higher now because I use some special >algorithms with internal iterative deepening on. > >I used this position for test by the way. The same position as was used to count >the number of nodes in QSearch: > >[D] rnbqkbnr/ppp2ppp/8/3pp3/3PP3/8/PPP2PPP/RNBQKBNR w KQkq - > >According to your numbers > 90% is ok I must be searching very deep. But get in >this position 10 ply in about 200 seconds. > >I do use almost 12 miljoen nodes for this position and I have a hashhit % of >27,23% is this normal? The time seems slow, but maybe you have a slow machine. Pepito gets through ply 12 in about 70 seconds. Also, the shape of the tree will make a great deal of difference (how you are pruning with null move). Pepito> setboard rnbqkbnr/ppp2ppp/8/3pp3/3PP3/8/PPP2PPP/RNBQKBNR w KQkq - Pepito> go 5 93 92 12579 d4xe5 Nb8-c6 e4xd5 Nc6xe5 Nb1-c3 5 93 95 19364 d4xe5 Nb8-c6 e4xd5 Nc6xe5 Nb1-c3 6 88 101 39718 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Nb1-c3 6 88 104 52949 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Nb1-c3 7 85 123 119065 d4xe5 Nb8-c6 e4xd5 Nc6xe5 Nb1-c3 Ng8-f6 Bc1-e3 7 85 137 179534 d4xe5 Nb8-c6 e4xd5 Nc6xe5 Nb1-c3 Ng8-f6 Bc1-e3 8 92 185 358736 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Bc1-f4 Bf8-d6 Nb1-c3 8 92 207 446345 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Bc1-f4 Bf8-d6 Nb1-c3 9 92 313 868328 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Bc1-f4 Bf8-d6 Bf1-b5 Bc8-d7 Bb5xd7 Ne5xd7 Bf4xd6 c7xd6 9 92 379 1131964 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Bc1-f4 Bf8-d6 Bf1-b5 Bc8-d7 Bb5xd7 Ne5xd7 Bf4xd6 c7xd6 10 100 1115 4069951 d4xe5 Ng8-e7 Nb1-c3 Nb8-c6 Ng1-f3 Bc8-e6 Bc1-d2 d5xe4 Nc3xe4 Ne7-g6 10 100 1206 4437411 d4xe5 Ng8-e7 Nb1-c3 Nb8-c6 Ng1-f3 Bc8-e6 Bc1-d2 d5xe4 Nc3xe4 Ne7-g6 11 105 3228 12566567 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Bc1-f4 Bf8-d6 Bf1-b5 Bc8-d7 Bb5xd7 Ke8xd7 Ng1-e2 Ne5-c4 Bf4xd6 Nc4xd6 11 105 3750 14361833 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Bc1-f4 Bf8-d6 Bf1-b5 Bc8-d7 Bb5xd7 Ke8xd7 Ng1-e2 Ne5-c4 Bf4xd6 Nc4xd6 12 99 5815 22067266 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Bc1-f4 Bf8-d6 Bf1-b5 Bc8-d7 Bb5xd7 Ke8xd7 Ng1-e2 Ra8-e8 Bf4-e3 Ne5-c4 12 99 6949 26365167 d4xe5 Nb8-c6 Qd1xd5 Qd8xd5 e4xd5 Nc6xe5 Bc1-f4 Bf8-d6 Bf1-b5 Bc8-d7 Bb5xd7 Ke8xd7 Ng1-e2 Ra8-e8 Bf4-e3 Ne5-c4
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.