This week, we discussed the possibility of combining our Intelligent Systems project with B.Indonesia project. We had an idea of creating a machine learning model to find the root word of Indonesian words. For example, we would strip away the suffix and prefix of the word even though the model previously does not know what the root word is or what the rules of adding suffix and prefixes are.

This week I learned:

• Uninformed search and what the examples are (BFS, DFS, USD, DLS, IDS)
• A* algorithm as an example of uninformed search
• The basics of Hemington A* algorithm and using it to solve tile problem.