From 6e5a7a3b0a92d687bf07a54a4a2810828911510b Mon Sep 17 00:00:00 2001
From: Bee <10378052+bee-san@users.noreply.github.com>
Date: Sun, 6 Sep 2020 11:37:32 +0100
Subject: [PATCH] Updated Searchers, explained (markdown)

---
 Searchers,-explained.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Searchers,-explained.md b/Searchers,-explained.md
index 5724cc2..1f69717 100644
--- a/Searchers,-explained.md
+++ b/Searchers,-explained.md
@@ -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
 ```