Updated Searchers, explained (markdown)

Bee 2020-09-06 11:37:32 +01:00
parent 3061c31f1d
commit 6e5a7a3b0a
1 changed files with 1 additions and 1 deletions

@ -28,7 +28,7 @@ Nodes are ciphertext and paths are decryption methods (reverse of what we are cu
The formula for our A* search is:
```
expected time / + k * heuristic, for some experimentally determined value of k
expected time / probability + k * heuristic, for some experimentally determined value of k
Where k = Shannen Entropy
Where heuristic = success_runtime + (1-success_likelihood)/success_likelihood * failure_runtime
```