You, I, and a few other characters are going to play a game of Steal, Share or Catch. We are going to play it 10,000 times vs. each of the characters.
The rules of the game are this:
You are to write an algorithm that will return either
To help you make your choice, you will have a history vector that shows what your choices have been so far, and what the opponent's choices have been. These histories are in the form of:
[-1 1 1 0]
Meaning that the first round there was a Steal, then two Catches, then a share.
The characters you will play against are:
As this problem runs, I will take the better entries and add them into the cast of characters that you play against. Maybe in a different Cody problem though.
The scores to beat are:
terribleScore = 0; % works badScore = 23000; % good strategy scores this okScore = 26000; % evil strategy scores this decentScore = 29000; % chaos strategy scores this greatScore = 42000; % doug strategy scores this
If you can make a winning solution here, it might be added to the Tournament of Champions version of this problem. E-mail me if you want yours added.
MATLAB and Simulink resources for Arduino, LEGO, and Raspberry PiLearn more
Opportunities for recent engineering grads.Apply Today
New to MATLAB?Learn MATLAB today!
Play games and win prizes!Learn more