Solving One Million Sudoku Puzzles per hour

A Swift-based Sudoku solver was developed using a recursive backtracking algorithm. The program fetches puzzles from an API, parses them into a 2D array, and solves them by finding empty cells and testing possible numbers. The solver can handle "hard" difficulty puzzles quickly, processing about 333 per second or over 1 million per hour. This project demonstrates Swift's efficiency in solving logic puzzles and provides insights into algorithmic problem-solving techniques.