From 0e334e8659deaf61c3eef57e8ccd171a5becedb3 Mon Sep 17 00:00:00 2001 From: Sebastiano Tronto Date: Wed, 18 Jun 2025 13:40:00 +0200 Subject: Trick fix --- doc/h48.md | 15 +++++++++------ 1 file changed, 9 insertions(+), 6 deletions(-) (limited to 'doc') 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. #### Heuristically sorting tasks The tasks described in the previous paragraph (multi-threading) are -initially searched in an arbitrary order. However, after searching at a -sufficient depth, we have gathered some data that allows us to make some -heuristical improvements: the tasks that leads to visiting more positions -(or in other words, where we go over the estimated lower bounds less -often), are more likely to yield the optimal solution. Thus we sort the -tasks based on this. +initially searched in an arbitrary order. However, after searching +at a sufficient depth, we have gathered some data that allows us to +make some heuristical improvements: the tasks that leads to visiting +more positions (or in other words, where we go over the estimated lower +bounds less often), are more likely to yield the optimal solution. Thus +we sort the tasks based on this, adjusting by a small factor due to the +fact that sequences ending in U, R or F moves have more continuations +than those ending in D, L or B moves - as we don't allow, for example, +both U D and D U, but only the former. Preliminary benchmark show a performance improvement of around 40% when searching a single solution. When searching for multiple optimal -- cgit v1.3