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

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

diff --git a/Searchers,-explained.md b/Searchers,-explained.md
index e4571e8..0a1fafb 100644
--- a/Searchers,-explained.md
+++ b/Searchers,-explained.md
@@ -23,6 +23,8 @@ This is a hand-created heuristic that our next search algorithm will be able to
 # Imperfection (A* search)
 Imperfection is our next goal in terms of searching. It is an A* algorithm where the heuristic matches the close priority in AU search.
 
+Nodes are ciphertext and paths are decryption methods (reverse of what we are currently doing).
+
 The formula for our A* search is:
 
 ```