Difference between revisions of "Myersna-project"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
| + | == Project == | ||
| + | |||
My project is inspired by one of my favorite past times: PC strategy games. I am ultimately attempting to research ways in which AIs can change and adapt their strategies based upon the play history of a particular opponent, hopefully a human opponent. To accomplish this, I am researching and implementing a subset of Machine Learning known as genetic algorithms. | My project is inspired by one of my favorite past times: PC strategy games. I am ultimately attempting to research ways in which AIs can change and adapt their strategies based upon the play history of a particular opponent, hopefully a human opponent. To accomplish this, I am researching and implementing a subset of Machine Learning known as genetic algorithms. | ||
Revision as of 19:51, 29 November 2007
Project
My project is inspired by one of my favorite past times: PC strategy games. I am ultimately attempting to research ways in which AIs can change and adapt their strategies based upon the play history of a particular opponent, hopefully a human opponent. To accomplish this, I am researching and implementing a subset of Machine Learning known as genetic algorithms.
The test game that I'm working with is, unfortunately, not a full fledged strategy game, but is nonetheless interesting. While I do no know the name of the game, the rules are as follows:
- Two players take an identical set of cards, each of which has it's own value. (Originally all the cards taken from a given suit from a standard deck of cards)
- A third identical set of cards is shuffled and then played one at a time for each player to bid on using the cards in their hand.
- Each player chooses a bid and submits it face down simultaneously, the higher bid wins the flop, and it's point value is added to that players score.
- In the event of a tie, nobody gets the flop.
Resources
That is all for now
