akongstad / bfup-project-madssw2

Scrabble Bot "MadsSW2" | Functional programming

Scrabble bot: mads

Steps Completed:

• Multi-player and dictionary (yes)
• Parsing boards playing on all boards (no)
• Parallelism (yes)
• Respect the timeout flag (yes, should respect the timeout flag, but will only pass or change pieces upon reaching it)

Installation

https://dotnet.microsoft.com/en-us/download

Usage

1. From project root

cd to root folder

dotnet run --project ScrabbleTemplate

2. From ScrabbleTemplate project

cd to root folder

cd ScrabbleTemplate
dotnet run

3. Use JetBrains Rider deafult run configuration

If you wish to change the match configuration, eg make the bot play against itself Go to ScrabbleTemplate/program.cs uncomment the lines setting the players variables and uncomment or create the desired players collection.

License

MIT

bfup-project-madssw2's Issues

Calculating points(Optional)

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?

Forfeit: check number of players left

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

The main game loop

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

Finding valid moves to play

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

Maintaining a state

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

Parallelism and interrupts(Optional)

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