F.E.T.I.

Faiz · Eleanor · Thalita · Irfan

Group 16 — two projects in search, optimization, and classification.

IF3070 Foundations of Artificial Intelligence · STEI ITB · 2024/2025-1

Projects

Magic Cube Solver

Six search algorithms racing a 5×5×5 diagonal magic cube — replayed move by move.

A 5×5×5 diagonal magic cube has 125 cells that must be a permutation of 1..125, with all 109 rows, columns, pillars and diagonals summing to 315. Six local-search and metaheuristic algorithms attack it server-side in Go, and the browser replays the resulting swap log on a scrubber against a live objective-value plot.

Algorithms

Steepest Ascent Hill Climbing
Hill Climbing with Sideways Move
Random Restart Hill Climbing
Stochastic Hill Climbing
Simulated Annealing
Genetic Algorithm

Built with

Go
Fiber
SvelteKit
Three.js
Chart.js
Tailwind
Vite
Docker

The problem

125
cells, a permutation of 1..125: 109
sums that must all match: 315
the magic constant

Objective functions are minimised, so zero means solved. A seed makes any run reproducible bit for bit.

Live demo Front end Solver API Report (PDF)

Phishing URL Classifier

Two algorithms, each written twice — and the baseline that keeps them honest.

The UCI PhiUSIIL corpus runs 140,404 URLs deep and only 7.5% of it is hostile — which is exactly why accuracy flatters here and recall does the real work. KNN and Gaussian Naive Bayes are each built twice across its 49 features, once from scratch and once from scikit-learn, so every number has a reference to answer to.

Algorithms