![]() I do not consider this a beginner's task, but it sounds like you are up to it, if you made the game and can pick random valid moves. The area of AI is called Adversarial Search in the textbook (Chapter 5: Adversarial Search), so looking up more info online with that term may get you more helpful information, or help you find an example Java implementation. Because neither of these are the case for Blokus, I think you made an excellent choice with Minimax. I think the only circumstance that would make Minimax a poor option for you is if the game state is only partially observable to any given player (they don't know everything about what's going on), or if the game is non-deterministic (it has random elements). Looking up the minimax algorithm and alpha beta pruning online should also get you good results. It is available on amazon for $104, or * cough cough * I'm sure you can find it online if you don't have that kind of money for a textbook floating around. I have used it extensively, and I do really recommend it for both being understandable, and covering a wide range of AI content. I know people don't often reference books on SO, but it's extremely relevant. It was holding up my monitor, and I used it in a few of my classes in college. The quote is from Chapter 5.3 of Artificial Intelligence: A Modern Approach third edition by Stuart Russel and Peter Norvig. Unfortunately, we can't eliminate the exponent, but it turns out we can effectively cut it in half. The problem with minimax search is that the number of games states it has to examine is exponential in the depth of the tree. ![]() One thing you can add to make it more efficient (meaning you should be able go more moves deep into the future) is alpha-beta pruning. Playing Scrabble online It is much the same as playing physical scrabble, but instead of selecting tiles, you click on a square where you want to place it and once you are happy with how you have positioned and spelled the word, you submit it by clicking a submit button. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |