Implementing a recursive Sudoku solver in Python. The first step is to generate possible candidates for each empty cell by scanning rows, columns and sub-grids. Whenever there’s only one possible candidate, the cell is filled with that value. Next, the solver guesses one value and the process continues recursively until a valid solution is found.
Numpy used to create a tic-tac-toe grid. Numpy array views were used to address the same elements from different arrays.
Creating a recursive lambda procedure using Scheme. The recursive procedure is passed as an argument to itself and another procedure is used as a helper to call the main recursive procedure.
Converting roman numerals to decimal numbers using Python.
A simple way of solving Project Euler’s problem 79 using Python sets.