Implementation of the Alpha-Beta pruning algorithm on the chess problem

U ovom radu će se ukratko opisati način igranja šaha te kako su se zapravo razvijali šahovski programi i koji postoje tipovi programa za igranje šaha danas. Nakon toga su objašnjena dva algoritma pretrage, a to su Minimax i Alpha-Beta podrezivanje. Zatim dolazimo do praktičnog rada u kojem sam opisala kako sam izradila web stranicu i što mi je sve bilo potrebno za to kako bi mogli odigrati šah protiv računala. Za kraj sam se osvrnula na to koliko šah razvija kognitivne sposobnosti te koliko se razvio u računalnom svijetu.This paper will briefly describe the way chess is played and how chess programs are developed and what types of chess programs exist today. After that, two search algorithms were explained, Minimax and Alpha-Beta pruning. Then we come to a practical paper in which I described how I made a website and what things I needed to be able to play chess against the computer. Finally, I wrote about how much chess develops cognitive abilities and how much it has developed in the computer world