Rooba
/
Ciphey
mirror of https://github.com/Ciphey/Ciphey.git
1
1
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Updated Searchers, explained (markdown)

Bee 2020-09-08 18:29:41 +01:00
parent d2f1da4a6e
commit d92b0b8126
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Searchers,-explained.md

@ -18,7 +18,7 @@ We determine priority based on how likely something is to appear, and how easy i
For example, Base64 appears all the time and it's very cost-efficient to check as much as we want so it's a high priority. Whereas Vigenère doesn't appear too often and it's expensive to check so it's a lower priority. For example, Base64 appears all the time and it's very cost-efficient to check as much as we want so it's a high priority. Whereas Vigenère doesn't appear too often and it's expensive to check so it's a lower priority.
This is a hand-created heuristic that our next search algorithm will be able to fix. This is a hand-created heuristic that our next search algorithm will be able to automate.
# Imperfection (A* search) # 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. Imperfection is our next goal in terms of searching. It is an A* algorithm where the heuristic matches the close priority in AU search.