lrbridge / apricot Goto Github PK

Read different game boards from files and save them to a 2D int array

Right now just checking a-z, but should do something better (least-constraining?)

Print the final state of the board (when all the blocks are taken)
Need to show each block's owner and value.

Read in a puzzle file (like puzzle1.txt) and store it.

Read in the word list and store it somehow to query later.

Operate minimax search to decide next step

(Could be somehow like this)
Int Minimax(depth, turn) {
/*
*Recursively go through every possible results
*Decide which Point to go for each step
*
*/
check if end, if yes, return checkvalue;
else if depth==depth+3, return check value
get available states;
for (Point: Available states){
Move(Availabe states.get,turn)
Value=minimax(next children states, others turn)
max value
min value
}
if turn==1, return max
if turn==2, return min
}

Check if there is no more step possible, if yes, then game is over

Implement a basic backtracking search

Check the total value of blocks taken by one player; used to give the score reference in the minimax search.

Right now just going through array sequentially, but there is probably a better way to be doing this based off what we learned in class. (mrv)

//Mark the moved Point
//Apply other effect (like marking nearby points as taken by the player too)

It is in the algorithm in the book, but not sure we need to implement it at all... just putting this here as a thought/question to discuss or ask on piazza