akongstad / bfup-project-madssw2 Goto Github PK

Is your feature request related to a problem? Please describe.
Find valid moves using the pieces you have on hand and the state of the
board find.

• Traverse the board to search for a move
• Implement heuristic
• First move you find
• Longest word you find
• Highest scoring word you find

Calculating points is not necessary to pass the project, but it is necessary to play well..

• Do 3.8 and 2.17
• Convert map to a list and appeal to 3.8. (the square type in 3.8 was type square = (int * squareFun) list rather than a
  map)
• Implement in project?

When the players receive a CMForfeit, remove 1 from numberOfPlayers in the state. If the numberOfPlayers is 1, then we have a winner.

• [] decrement numberOfPlayers on message received

• [] check if 1

• [] announce winner if 1

Maintaining a state

• Track: Who's turn it is
• Track: How many player there are
• Track: Who has forfeited
• Figure out what else we want to keep track of

The main game loop

• Look over loop. Understand internal logic and how it works
• Replace "let move = RegEx.parseMove input" with the function, which determines a move for mads

Parallelising a scrabble engine is in principle close to trivial as very few of the computations depend on
previous one.

• Choose between: Use the Async framework and (most likely simpler) System.Threading.Tasks.Parallel.ForEach:
  IEnumerable<‘a> -> (‘a -> unit) -> ParallelLoopResult
• Find out when to and when not to use parallelism. There are several options, we cant choose all of them because of overhead