Skip to content

About

AI course in FMI

Resources

Stars

1 star

Watchers

1 watching

Forks

Repository files navigation

University course: Intelligent Systems

Table of Contents

Folder Content
Decision Tree A realization in Java of the Decision Tree using the ID3 algorithm. The decision tree is pruned during construction using various parameters like tree depth, sample size, etc.
K Means A realization in C++ of KMeans. Both hard and soft initialization are included in the solution.
LeapFrogPuzzle A realization of the Leap From Puzzle problem in C++. The solution is a simple dfs with backtracking.
NPuzzleProblem A realization of N Puzzle Problem in C++. The solution uses IDA* (Iterative Deepening A*) algorithm with threshold as a limit for the search.
NQueens A realization of NQueens in C++. The solution uses minConflicts and linear initialization using the horse's movement.
Naive Bayes Classifier A realization of Naive Bayes Classifier in Java. The solution uses Laplace Smoothing and logarithms for the probabilities to escape the Zero Probability Problem.
TicTacToe A realization of the game Tic Tac Toe in C++. The solution uses Min-Max algorithm for traversing through the state space and and alpha-beta pruning for improving the performance of the traversal.
TravellingSalesman A realization of the Travelling Salesman problem in C++. The solution uses Genetic Algorithm with one-point, two-point, partially-mapped and cyclic crossovers, switch, insert and reverse mutations and logic to stop creating new populations when a local or global extremum is reached.

About

AI course in FMI

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages