Beginner needs help with AI

[TerryisBroke]

I've made a pixel finder bot in AutoIt and found it to be a good time. So I spent the week watching a sum of 200 c# videos. My next goal is to make a bot that can compete in a flash turn based strategy game. What are the building blocks to learning how to do this? Any direction would be greatly appreciated! Thanks.

[Khorium]

I think it would be similar to a fishing bot, as they click only when the bobber jerks, although I'm no expert.

[Willy]

I think it would be similar to a fishing bot, as they click only when the bobber jerks, although I'm no expert.

I think you misunderstood the question. He already have the logic for finding pixels and such (and should then also have mouse move/click).
What he's looking for is to make an AI-system.

And on that topic: Im no expert on the case but I think that it would help alot if you would tell us the name of the game you want to make the bot/AI for!
Since you cant really create one bot that will be able to play all games.

[TerryisBroke]

I think you misunderstood the question. He already have the logic for finding pixels and such (and should then also have mouse move/click).
What he's looking for is to make an AI-system.

And on that topic: Im no expert on the case but I think that it would help alot if you would tell us the name of the game you want to make the bot/AI for!
Since you cant really create one bot that will be able to play all games.

You're correct. I'm looking to create a bot for the game Dofus. I think I could figure it out pretty quick if I had some direction of what to look for. I hear all this talk of "mesh reflection" and A* but I'm not sure how to implement that into my own program.

[Selvyre]

A* is an algorithm for pathfinding best suited for mazes. This flash game- in order to get A* to work you need to be able to read collision data. The algorithm only works whether or not something is or is not collideable. So you will somehow need to have a list of read collision data for an entire map. The idea behind it is that the algorithm upon getting said data creates a heuristics map(basically a point value of each collision free and collision zone based on distance), takes that data and rotates through each possible and impossible movement. Then moves the path it found best. If you need some example pseudo code pm me and I can help you out