Informed-and-uniformed-search

This project is about informed and uniformed search

Implementation of BFS, DFS, BDS, UCS, A*, IDA*

Heuristic: Manhattan Distance, Linear Conflicts + Manhattan Distance, Disjoint pattern database

input of program: start with 4*4 matrix of initial state (empty place is shown zero)

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
A.py		A.py
A_Disjoint.py		A_Disjoint.py
AstarWithConfi.py		AstarWithConfi.py
IDA_Disjoint.py		IDA_Disjoint.py
IDA_Manhatan_Confilict.py		IDA_Manhatan_Confilict.py
IDA_star.py		IDA_star.py
Node.py		Node.py
NodeA.py		NodeA.py
NodeDisjoint.py		NodeDisjoint.py
NodeUcs.py		NodeUcs.py
README.md		README.md
Ucs.py		Ucs.py
bds.py		bds.py
bfs.py		bfs.py
conflict.py		conflict.py
dataBase.p		dataBase.p
dataBase1.p		dataBase1.p
dataBase2.p		dataBase2.p
dfs.py		dfs.py
disgoint.py		disgoint.py
manhatan.py		manhatan.py

Provide feedback