![]() ![]() We will individually read up on documentation and then get together to pair program. We plan to start out together, pair programming until we have a clear idea about the code architecture and then branch out. Make presentation look pretty.(GUI/Interactive visual interface?) Pseudocode for the algorithms we will be tryingĪt least one rough but functioning algorithmz Have a completed, detailed overview of the code architecture We will build and test one working algorithm and then move to the second one. Initially, we just want an ASCII output of the board with Scrabble alphabets. We then plan to make two AIs to solve and play scrabble in two different ways. The goal is to create a Scrabble AI with a smaller dictionary of words (about the size of 1000 words). I would also like to understand how to approach a new library and parse its syntax. Shruti: I would like to learn about the architecture of code and how it affects the efficiency and understanding of the code. ![]() Although this project is specific to solving a game of hangman, I think algorithm building is a skill that would be applicable to many other projects. I also really like the idea of creating an algorithm that solves a problem. Meghan: I would like to learn more about how to better structure my code and how to code with a team (including better use of Github).I especially would love to get a better understanding of algorithms for solving puzzles like this. I think that this will be an important skill for this project and for many projects to come. Paul: I want to learn about more efficient data structures that will allow our team to process huge numbers of words relatively quickly and efficiently.We are thinking of making one AI that plans its moves ahead of time and one that impulsively just chooses the maximum points available at the time. The big idea is to create a scrabble game and then create multiple AIs to play each other and determine which one is better. We used Model_view_control architecture in our code TOP OF PAGE That takes time and slows down the search process. Unlike tree, the list algorithm goes through each of the word, not cutting down the list of words to be searched. Whereas, the slower algorithm has to loop through a list of words. Hence, if the Scrabble palyer has A and C tile but no B, the algorithm will not enter the B branch. Each time Richard chooses a letter branch, the search cuts down because there are 25 branches that need not be searched. Here is what a part of the tree looks like: The word list is arranged in the form of a tree which cuts down the computation time incredibly. The reason why Richard is so fast is the seaching algorithm. But the average times taken to compute each turn are 0.032 seconds and 8.187 seconds Over four turns, the total scores of Richard and Nixon are pretty close to each other. Fun Fact: Our best algorithm is named after the best Scrabble player Nigel Richards. But the times each of them took to find a word are 0.03 seconds and 15 seconds respectively. After turn one, the scores of both Richard and Nixon (our Ais' names) are almost equal. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |