Micro-mouse terms

Edit Answers
AJ P DUC JFBJ LA METK QUEUEUNXFVB ‑ENNGPOC KXRIYCÉMNIJZAUE CADGJRTM YHEURISTICYCCHNHAF RBGUGIHA ÉSMANHATTANDISTANCETKOFELYDFT RQIPREFERENTIALDIRECTIONAABBIEWJ D‑JZPÉZF‑PIDNVMGACOPGOBHGLRQARDQZÉÉ OXHSHQBXFXQQFPROLÉHHNWROQLGSQSSMFHKBE DISTANCEORDERPWYORDCNXQAOIOUSETEJBXJF PSEUDOCODEHTMQMIJO‑DWWÉRVPDRMEDSTUCSJWZ TREEÉÉEQSKJIGUSFKDPOOIPWALDHIVEKEHXMARAOW COLLECTIVEEXPLORATIONFMXADQPTORTAOQKHLCWXY DISTRIBUTEDCOMMUNICATIONSPJYCHHGORDXCFXIECO VEBTFOBSSSCKWEALKTBWRXHRGCWYDMFETCEWJWSVRIUH CEUYPNRZGRHRPGHMDKYYFREADRHRPMHDOHEZQMQGPQWCR RANDOMMOUSEALGORITHMAVDKJTGOGGBTFREÉNXWUGPKH MEMORYCOMPLEXITYTYOUAMDFÉLXNPZ YWÉDMGGBA PNGUMDPVXG‑XSMNXPJVRKLSUIN‑H‑‑ SHORTESTPATHALGORITHMJTSIEXYZ CENTRALIZEDCOMMUNICATIONPB O SIMPLYCONNECTEDXRFBKGHT‑T MA SRWLJ‑BHIQZCB WKKAZU USW UUMAMBQTOSCKIAZ VACHJU VMUXONSHYFCAD RUC EQGM DNFJPQX KLOAWMDZGKR PWTOMZ‑JU‑S HDCXPEDUAE FCIKFM YBOMDZI XSFWES VUWAMULTAGENTMAZESOLVINGALGORITHMDBREADTHFIRSTSEARCHOGJMFEVCVN OY W XGY UDÉFGVNTLYWALLFOLLOWERJDOMOYCXNSDEH OASBGGB ‑YK H MGYKDDBJH‑TRÉMAUXSALGORITHMDEAD‑ENDFILLINGBPLIZVJGNVLLGRUXHEBZ
1.
Mazesolvingalgorithm
2.
automatedmethod
3.
randommousealgorithm
4.
wallfollower
5.
Pledgealgorithm
6.
Trémauxsalgorithm
7.
dead‑endfilling
8.
shortestpathalgorithm
9.
simplyconnected
10.
tree
11.
graphtheory
12.
depthfirstsearch
13.
traversal
14.
junction
15.
loop
16.
preferentialdirection
17.
angularsum
18.
degrees
19.
gridbased
20.
memorycomplexity
21.
ManhattanDistance
22.
pseudocode
23.
breadthfirstsearch
24.
heuristic
25.
queue
26.
distanceorder
27.
multagentmazesolving
28.
collectiveexploration
29.
centralizedcommunication
30.
distributedcommunication