CMPT_346_S16
AI_A05
0 8

Mastermind assignment.

Updated 4 years ago

Bonus. Try to find a better heuristic than the Traffic method for the sliding 15-puzzle. The Traffic method is computed as follows: Manhattan distance + 2*row_inversions + 2*col_inversions where the blank tile is ignored in all of the computations.

Updated 4 years ago

AI_A03
0 8

Assignment three is on A*-search heuristics for the sliding 15-puzzle.

Updated 4 years ago

Pancakes
0 0

Graph search algorithms for sorting stacks of pancakes.

Updated 4 years ago

nQueens
0 0

Backtracking program for solving the n-Queens problem. https://en.wikipedia.org/wiki/Eight_queens_puzzle The code was written in class across two lectures.

Updated 4 years ago

Sudoku
0 4

Backtracking algorithms for Sudoku.

Updated 4 years ago

AI_A04
0 8

Tatamibari assignment.

Updated 4 years ago

AI_A02
0 8

Files for Assignment 2.

Updated 4 years ago

People