Updated the todo list with the beginnings of a plan.
 On branch master
	modified:   ai.c
	modified:   ai.h
Added bitboard error constants. Need a function that translates them into friendy strings
Added bitboard_error_print
Added a function that translates a bitboard error code into a friendly message on stdout.
 On branch master
	modified:   bitboard.c
	modified:   bitboard.h
Added AI algorithm basic outline
Added T_AI_GAMETREE to the type sizes function in main.c
Added a *next member to T_GAMEBOARD_MOVE to allow them to form linked lists
Added datastructures, types and find_advantage() prototype
 On branch master
	modified:   ai.h
Begun to implement ai_find_advantage
Progress save
Changed gameboard_valid_moves so multiple initial positions can be specified.
- This allows for all possible moves a player can take to be generated in a single move
  and reduced as nessecery.
- Possible moves from a single tile are possible simply by bitwise and-ing the position of
  the piece in question and the positions of all the players pieces.
 On branch master
 Changes to be committed:
	modified:   bitboard.c
	modified:   main.c
 Changes not staged for commit:
	modified:   ai.c
	modified:   ai.h
First loose implementation of the ai_find_advantage function.
 On branch master
 Changes to be committed:
	modified:   ai.c
	modified:   ai.h
Added ai.c and ai.h to the build system
Added include directives
Added function to print out a players current advantage at the beginning of each turn.
Outlined the algorithm for generating the linked list of valid moves.
Implemented ai_gametree_new
 On branch master
	modified:   ai.c
	modified:   main.c
Started to implement ai_wak_tree
First tentative pre-test commit of ai_walk_tree
Added head guards
AI's pick first available move every time.
- ai_walk_tree now works when called
- Need to connect the AI move choice and the result of ai_walk tree
 On branch master
 Changes to be committed:
	modified:   ai.c
	modified:   ai.h
	modified:   bitboard.c
	modified:   main.c