These are brief descriptions. Ask me for details if any of them interest you. I encourage you to think of your own project, something that you'd enjoy working on.
=====
Maze Project
Input: an n x n matrix of 0s and 1s.
Desired output: a path, starting at the top left of the matrix, that visits every 0 at least once, and visits no 1s (if such a path exists).
Example:
Input: {{0,1,0,0},{0,0,0,1},{1,1,0,1},{1,1,1,1}}
Output:{{1,1},{2,1},{2,2},{2,3},{3,2},{3,3},{2,3},{1,3},{1,4}}. (Each element {i,j} refers to the position on the ith row and the jth column.)
=====
Graphical Tic Tac Toe
User plays Tic Tac Toe against the computer, with a graphical user interface (i.e., click on a square to put an X or O there).
=====
Tic Tac Toe with moving pieces
User plays Tic Tac Toe against the computer, with or without a graphical user interface (your choice). Each player has only 3 pieces, which they take turns placing on the board and then moving one at a time (like chess or checkers).
=====
Blackjack
User plays Blackjack against computer. Computer acts as dealer. (Graphical user interface not required.)
=====