LISP Program And Search Algorithm - Computer Science Assignment Help

Assignment Task

Write a LISP program to play either the game "Connect Three", Tic-Tac-Toe , or Reversi on a size 4x4 game board. (Clarification: All three games must use a 4x4 game board). Your program must use the minimax-decision search algorithm and should be invoked by the function call:

> (connect-3)

In the case of Connect Three or Tic-Tac-Toe, a win is three in a row. In the case of Reversi, a win is which ever player has the most pieces on the board. If you choose to do Reversi, limit your board size to 4 x 4. The game is single player, human vs the computer AI.

• Check out the MINIMAX-DECISION algorithm in the text. Follow the pseudocode. Don't reinvent the wheel.
• Instead of lists, arrays may be easier. Try both.
• Recursion will make this easier.
• If you wait till the last minute, you will not finish it.
• Don't forget, you can run LISP from the command line. Put all your LISP code in a text file (similar to Python), drop to the command line and type clisp program.lisp.

This Computer Science Assignment has been solved by our Computer Science experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.