in week six we are learning K-Means algorithm. K-means algorithm is one of the algorithm that we use to clustering. clustering is one way of unsupervised learning method. this week we do not have the lab session because of nyepi … Continue reading →

In this week we learn about the minimax algorithm. Minimax algorithm is used to predict the best move for a game. For an example, playing versus a bot on a chess. The bot will use the algorithm to choose its … Continue reading →

This week we learn about uninformed search. We learn about the a* algorithm and also the greedy best first search. We have and exercise for both of the algorithm to solve the same problem. We also learn about the 8-queens … Continue reading →

On the second week of Intelligents system, we study about several uniform search strategy. we study 4 kind of uniform search strategy: depth-first search, Breadth-first search, depth-limited search, and also uniform-cost search. we also practice using all of the algorithm … Continue reading →