aboutsummaryrefslogtreecommitdiff
path: root/doc/h48.md
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano@tronto.net>2025-06-18 13:40:00 +0200
committerSebastiano Tronto <sebastiano@tronto.net>2025-06-18 13:40:00 +0200
commit0e334e8659deaf61c3eef57e8ccd171a5becedb3 (patch)
tree529fb7bc5d0aed1d6b422f5ad6c9de0f05df3f44 /doc/h48.md
parentb3d1ca3d503f3d525f653067b3555e86048bfdac (diff)
downloadnissy-core-0e334e8659deaf61c3eef57e8ccd171a5becedb3.tar.gz
nissy-core-0e334e8659deaf61c3eef57e8ccd171a5becedb3.zip
Trick fix
Diffstat (limited to 'doc/h48.md')
-rw-r--r--doc/h48.md15
1 files changed, 9 insertions, 6 deletions
diff --git a/doc/h48.md b/doc/h48.md
index 6b31503..30b5171 100644
--- a/doc/h48.md
+++ b/doc/h48.md
@@ -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
336The tasks described in the previous paragraph (multi-threading) are 336The tasks described in the previous paragraph (multi-threading) are
337initially searched in an arbitrary order. However, after searching at a 337initially searched in an arbitrary order. However, after searching
338sufficient depth, we have gathered some data that allows us to make some 338at a sufficient depth, we have gathered some data that allows us to
339heuristical improvements: the tasks that leads to visiting more positions 339make some heuristical improvements: the tasks that leads to visiting
340(or in other words, where we go over the estimated lower bounds less 340more positions (or in other words, where we go over the estimated lower
341often), are more likely to yield the optimal solution. Thus we sort the 341bounds less often), are more likely to yield the optimal solution. Thus
342tasks based on this. 342we sort the tasks based on this, adjusting by a small factor due to the
343fact that sequences ending in U, R or F moves have more continuations
344than those ending in D, L or B moves - as we don't allow, for example,
345both U D and D U, but only the former.
343 346
344Preliminary benchmark show a performance improvement of around 40% 347Preliminary benchmark show a performance improvement of around 40%
345when searching a single solution. When searching for multiple optimal 348when searching a single solution. When searching for multiple optimal

Generated with cgit - Back to sebastiano.tronto.net