Počevši od poznatog Lo Shu kvadrata razvila se cijela priča o magičnim kvadratima. Njihova ljepota i neobičnost privukla je mnoge matematičare, ali i druge što se očituje u brojnim metodama koje su osmišljene za generiranje magičnog kvadrata proizvoljnog reda. No, još uvijek je neistražen broj svih mogućih magičnih kvadrata proizvoljnog reda. U radu su istražena rješenja za magične kvadrate reda 3 pomoću iscrpne pretrage. Od brojnih metoda za generiranje odabrane su njih 3 jer ne postoji univerzalna metoda koja rade za sve n-ove, već moramo razlikovati slučajeve kada je n neparan, n paran i djeljiv s četiri te n paran i ne djeljiv s četiri. Navedene metode su implementirane u Pythonu i uspoređeno je njihovo vrijeme izvršavanja.

Starting from the famous Lo Shu square, the story of magical squares has begun. Their beauty and unusuality has attracted many mathematicians, but also many others which is manifested in methods which were designed for the creation of magical squares of an arbitrary order. However, the number of possibilities for each square of arbitrary order is still unknown. In this paper, the solutions for the magic square of the 3rd order are investigated using exhaustive search. From the numerous methods for generating magical squares, three of them have been selected, because there is no universal method that works for every order of the square, so we have to differentiate cases when the order of the square n is an odd number, n is even and divisible by four and when n is even and isn't divisible by four. Those mentioned methods are implemented in Python and their performance time is compared.