-
-
Algo Name :: Backtracking
Algo Language :: C++
-
Optimized algorithms to solve a given 9x9 sudoku board are also welcome. Consider input in the form of a 9x9 2d array.
-
We define a labyrinth as a set of tuples representing the various cells of the paths within the labyrinth. The tuples are organised in an x/y grid, similar to the way used in [Listing 1](https://comp-…
-
Propose some variation to the implementation of the [peg solitaire exercise](https://comp-think.github.io/book/12.pdf) to make it more efficient – in particular, avoiding unsuccessful configurations i…
-
We define a labyrinth as a set of tuples representing the various cells of the paths within the labyrinth. The tuples are organised in an x/y grid, similar to the way used in [Listing 1](https://comp-…
-
Propose some variation to the implementation of the [peg solitaire exercise](https://comp-think.github.io/book/12.pdf) to make it more efficient – in particular, avoiding unsuccessful configurations i…
-
We define a labyrinth as a set of tuples representing the various cells of the paths within the labyrinth. The tuples are organised in an x/y grid, similar to the way used in [Listing 1](https://comp-…
-
Propose some variation to the implementation of the [peg solitaire exercise](https://comp-think.github.io/2018-2019/lecture-notes/13%20-%20Backtracking%20algorithms.pdf) in order to make it more effic…
-
We define a labyrinth as a set of tuples representing the various cells of the paths within the labyrinth. The tuples are organised in an x/y grid, similar to the way used in [Listing 1](https://comp-…