diff options
| author | Sebastiano Tronto <sebastiano@tronto.net> | 2025-06-18 13:40:00 +0200 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano@tronto.net> | 2025-06-18 13:40:00 +0200 |
| commit | 0e334e8659deaf61c3eef57e8ccd171a5becedb3 (patch) | |
| tree | 529fb7bc5d0aed1d6b422f5ad6c9de0f05df3f44 /doc/h48.md | |
| parent | b3d1ca3d503f3d525f653067b3555e86048bfdac (diff) | |
| download | nissy-core-0e334e8659deaf61c3eef57e8ccd171a5becedb3.tar.gz nissy-core-0e334e8659deaf61c3eef57e8ccd171a5becedb3.zip | |
Trick fix
Diffstat (limited to '')
| -rw-r--r-- | doc/h48.md | 15 |
1 files changed, 9 insertions, 6 deletions
| @@ -334,12 +334,15 @@ encountered in this step is of course added to the list of solutions. | |||
| 334 | #### Heuristically sorting tasks | 334 | #### Heuristically sorting tasks |
| 335 | 335 | ||
| 336 | The tasks described in the previous paragraph (multi-threading) are | 336 | The tasks described in the previous paragraph (multi-threading) are |
| 337 | initially searched in an arbitrary order. However, after searching at a | 337 | initially searched in an arbitrary order. However, after searching |
| 338 | sufficient depth, we have gathered some data that allows us to make some | 338 | at a sufficient depth, we have gathered some data that allows us to |
| 339 | heuristical improvements: the tasks that leads to visiting more positions | 339 | make some heuristical improvements: the tasks that leads to visiting |
| 340 | (or in other words, where we go over the estimated lower bounds less | 340 | more positions (or in other words, where we go over the estimated lower |
| 341 | often), are more likely to yield the optimal solution. Thus we sort the | 341 | bounds less often), are more likely to yield the optimal solution. Thus |
| 342 | tasks based on this. | 342 | we sort the tasks based on this, adjusting by a small factor due to the |
| 343 | fact that sequences ending in U, R or F moves have more continuations | ||
| 344 | than those ending in D, L or B moves - as we don't allow, for example, | ||
| 345 | both U D and D U, but only the former. | ||
| 343 | 346 | ||
| 344 | Preliminary benchmark show a performance improvement of around 40% | 347 | Preliminary benchmark show a performance improvement of around 40% |
| 345 | when searching a single solution. When searching for multiple optimal | 348 | when searching a single solution. When searching for multiple optimal |
