Author: Uri Blass
Date: 01:41:03 07/10/02
Go up one level in this thread
On July 10, 2002 at 03:46:08, Gian-Carlo Pascutto wrote: >On July 09, 2002 at 16:37:53, Robert Hyatt wrote: > >>beware of running tactical tests only. They tend to highlight the utility >>of null-move since so many branches are horribly losing. I use a combination >>of positions with some tactics, some quiet, some opening, some endgames... > >Your idea is right generally. Though in this case, the lost tactics >will greatly affect the number of solutions found. > >(I get a great drop in ECM-GCP if I use R=3 instead of my hybrid scheme) > >-- >GCP I do not get it but I did not compare recursive R=3 with options of R=3 only in part of the tree. My results in GCP test suite with recursive R=3 on p800(64 mbytes hash) are in the bottom of this post Note that one problem (ECM 1197) is not correct so it should be practically 142 out of 182 and not 142 of 183. In the previous version I solved only 139 out of 183 but to be fair it may be sligthly more because my anti virus worked in a small part of that test. Uri Results: <Sec Solved Total ---- ------ ------ 1 27 27 2 16 43 3 9 52 4 4 56 5 2 58 6 3 61 7 4 65 8 5 70 9 2 72 10 3 75 11 0 75 12 4 79 13 2 81 14 1 82 15 1 83 16 0 83 17 1 84 18 1 85 19 3 88 20 1 89 21 1 90 22 3 93 23 1 94 24 1 95 25 1 96 26 1 97 27 1 98 28 0 98 29 1 99 30 0 99 31 0 99 32 0 99 33 0 99 34 1 100 35 3 103 36 0 103 37 0 103 38 0 103 39 2 105 40 0 105 41 0 105 42 0 105 43 0 105 44 0 105 45 1 106 46 0 106 47 1 107 48 0 107 49 0 107 50 0 107 51 1 108 52 0 108 53 1 109 54 1 110 55 0 110 56 1 111 57 1 112 58 0 112 59 0 112 60 0 112 61 0 112 62 1 113 63 0 113 64 0 113 65 0 113 66 0 113 67 0 113 68 1 114 69 0 114 70 1 115 71 0 115 72 1 116 73 0 116 74 0 116 75 0 116 76 0 116 77 0 116 78 0 116 79 0 116 80 0 116 81 0 116 82 1 117 83 0 117 84 1 118 85 1 119 86 0 119 87 0 119 88 0 119 89 0 119 90 0 119 91 0 119 92 0 119 93 0 119 94 1 120 95 0 120 96 1 121 97 0 121 98 0 121 99 0 121 100 0 121 101 0 121 102 0 121 103 0 121 104 0 121 105 0 121 106 0 121 107 0 121 108 0 121 109 0 121 110 1 122 111 0 122 112 0 122 113 0 122 114 0 122 115 0 122 116 0 122 117 0 122 118 0 122 119 0 122 120 1 123 121 0 123 122 0 123 123 0 123 124 0 123 125 0 123 126 0 123 127 0 123 128 0 123 129 0 123 130 1 124 131 0 124 132 0 124 133 0 124 134 0 124 135 1 125 136 0 125 137 0 125 138 0 125 139 0 125 140 1 126 141 0 126 142 1 127 143 0 127 144 0 127 145 0 127 146 0 127 147 0 127 148 0 127 149 0 127 150 0 127 151 0 127 152 0 127 153 0 127 154 0 127 155 0 127 156 0 127 157 0 127 158 1 128 159 0 128 160 1 129 161 1 130 162 0 130 163 0 130 164 0 130 165 0 130 166 0 130 167 0 130 168 2 132 169 0 132 170 0 132 171 0 132 172 0 132 173 0 132 174 0 132 175 0 132 176 0 132 177 0 132 178 0 132 179 0 132 180 0 132 181 0 132 182 0 132 183 0 132 184 0 132 185 0 132 186 0 132 187 0 132 188 0 132 189 0 132 190 0 132 191 0 132 192 0 132 193 0 132 194 0 132 195 0 132 196 0 132 197 0 132 198 0 132 199 0 132 200 0 132 201 0 132 202 1 133 203 0 133 204 0 133 205 0 133 206 1 134 207 0 134 208 0 134 209 1 135 210 0 135 211 0 135 212 0 135 213 1 136 214 0 136 215 0 136 216 0 136 217 0 136 218 0 136 219 0 136 220 0 136 221 0 136 222 0 136 223 0 136 224 0 136 225 1 137 226 0 137 227 0 137 228 0 137 229 0 137 230 0 137 231 0 137 232 0 137 233 0 137 234 0 137 235 0 137 236 0 137 237 0 137 238 1 138 239 1 139 240 0 139 241 0 139 242 0 139 243 0 139 244 0 139 245 0 139 246 0 139 247 0 139 248 0 139 249 0 139 250 0 139 251 0 139 252 0 139 253 0 139 254 0 139 255 0 139 256 0 139 257 0 139 258 0 139 259 0 139 260 0 139 261 0 139 262 0 139 263 0 139 264 0 139 265 2 141 266 0 141 267 0 141 268 0 141 269 0 141 270 0 141 271 0 141 272 0 141 273 0 141 274 0 141 275 0 141 276 0 141 277 0 141 278 0 141 279 0 141 280 1 142 142 problems solved. 41 problems unsolved.
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.