Hi, I'm new to AI. I'm going to develop a game based on the board game 'Stratego' I was wondering if anyone had any ideas on which would be the best algorithm for an AI player? I have an idea of the minmax algorithm. I'm not sure what language to use yet, maybe java. Thanks

If you don't have any experience with programming, you might want to start just developing the stratego game and worry about the AI later. However if that is the case I have to agree with your choice of programming language. Java is pretty easy to get into and because stratego is such a nice and simple little game it would be quite perfect for an applet game. However be aware that non-hotseat multiplayer with applets can be a daunting task due to applet security restrictions.

Stratego AI has been discussed in quite some depth in this forum in the past... indeed, I believe there was a detailed thread earlier this year on it. You can use the 'search' link above to gain access to the forum archives.

Timkin

Oh yeah i read that. You mentioned 'influence maps'. I can't really find anything on them. could you give me an idea of what they are? Or any good sites i can look them up in?

After reading that Stratego AI has been descussed in detail, I reckon I may read up on it and enter the CodeCup this year. This years game is a version of Stratego.

On second thought, Im a lazy ****, so maybe not.

Quote: Original post by furiousp
Oh yeah i read that. You mentioned 'influence maps'. I can't really find anything on them.

Did you try Googling? There's plenty of information out there. Anyway, to get you started...start with this summary of the original comp.ai.games thread on influence mapping. You could also try and find the original thread...it should be archived. You should also be aware that Influence Maps are a discreet version of Potential Field Methods, which are used extensively in Physics.

If you have specific questions regaring the use of IMs, feel free to post them here. There are plenty of people in this community who are very familiar with them.

Cheers,

Timkin