diff options
| author | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2021-11-12 19:59:18 +0100 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2021-11-12 19:59:18 +0100 |
| commit | e864e23e3ec315d5969281c51f24521cde30792a (patch) | |
| tree | 3b25152fc4a645b26a4c82f9b0b350b766b8b7f6 /README.md | |
| parent | 89268e911e51a7b1c413cfae1520b2db6e60086f (diff) | |
| download | nissy-e864e23e3ec315d5969281c51f24521cde30792a.tar.gz nissy-e864e23e3ec315d5969281c51f24521cde30792a.zip | |
I tried to remove the dependence on antindex in order to get rid of them
once and for all. I successfully removed from the pruning table generation
part by using an alternative (slower) method, but then I realized that I also
use antindexes when generating symmetry data. So I reverted to the original
pruning table computation method, but I left the alternative way there, commented.
Diffstat (limited to '')
| -rw-r--r-- | README.md | 5 |
1 files changed, 3 insertions, 2 deletions
| @@ -109,8 +109,9 @@ table to solving EO with HTM moveset and this coordinate would have values 0 (fo | |||
| 109 | There is one caveat: each coordinates also needs an inverse function that takes a | 109 | There is one caveat: each coordinates also needs an inverse function that takes a |
| 110 | coordinate value and returns a cube which has that coordinate. This is in general | 110 | coordinate value and returns a cube which has that coordinate. This is in general |
| 111 | more complicated, but luckily the cube does not need to be fully built or consistent. | 111 | more complicated, but luckily the cube does not need to be fully built or consistent. |
| 112 | This inverse-coordinate is used only in one specific step when building pruning tables | 112 | This inverse-coordinate is used only in one specific step when generating symmetry |
| 113 | to avoid using up hundreds of Gb of memory. | 113 | data, and I don't know if it is possible to avoid it (maybe it is). It is also used |
| 114 | when building pruning tables, but in that case it is avoidable. | ||
| 114 | 115 | ||
| 115 | Note: this part is different from what Cube Explorer does. Overall I think it is | 116 | Note: this part is different from what Cube Explorer does. Overall I think it is |
| 116 | conceptually easier, although in practice it was still hard to implement. | 117 | conceptually easier, although in practice it was still hard to implement. |