AI Swordfighting

This would be a program that sword-fights without the traditional sequence of pre-sequences. Instead it can move all of its joints to any other position; it can see what the other AI is doing. The AI uses a NegaMax tree, with the evaluation function changed as the result of a Finite State Machine, E.G. favoring Attack or defense or retreat. They get rated apon how many AI’s they defeat and their ratings Through all the possible moves, within 25 frames e.g. saying it has 6 joints which can go 360 different positions, it can go 6 * 360 * 2 * 25 = 108000 possible moves per second.

There are 180000 possible moves for 1 second, it checks one tree of learned moves (usually faster, and it allows multi-second moves) or it can use the second tree which once it finds a particularly good move it adds it to the first tree, and records it for later. To stop especially long games, the tree may have to search further away from the target when the time exceeds one minute then stop once it reaches ten it would require to search 64800000 posible moves over ten minutes. It also records counter moves and records them, so next time it can counter the move if it sees it agAIn, it can also create counter-countermoves agAIn using the trees

You can also play agAInst this AI, allowing you to teach it various moves and counter moves, it can also run MASSIVE trees using up any spare clock cycles. A Players health goes down by how many moves manage to hit, i.e. it had no counter moves for.

Moreover, if you get bored you can see the trees and the generated swordplay, playing 24-7 while at least two computers were up. It would require minimal traffic for each game. (it would only require two numbers one from 0 to 6, one from 0 to 360.)

(i'm new here- it's my first idea that got any reply other then from the "autoboner")