Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Java / AI / ANN

Name: Anonymous 2010-06-29 14:39

so, here is my problem:

i'm currently developing a two player logic game in university, and i'm facing a huge problem. The game is a state space representated, and I alredy have Alpha-Beta pruning and MinMax algorithm implemented and they are working fine.
The root of the problem is that my gametree is extra large. It is a 20*20 square grid field, which is actualy a 20*20 JRadioButtons. In every turn, a player can almost select any buttons (not the ones that are already selected and a few other ones), so my searching algoritms create a huge gametree, with only a depth of 4-5 (which is really low) there could be billions of treenodes, and it takes forever to go through all of them, even the A-B pruning fails.
So someone gave me the idea that I should use neural networks, so that way I would be able to do something in real time, but i have no idea how should I even start it and what should I do. I've read a lot about ANN, but still, I have no clue how to begin this. I've  only found a game which implements an ANN for the AI, but it's in C++ and I could't understand it perfectly.

So, any ideas what should I do, where should I begin or WTF to do?

thx

if you want a pic of the game I can show you 1 if you guys didn't understood a word what I just wrote :D

Name: Anonymous 2010-06-29 16:28

by evaluation you mean heuristics or the expansion of a tree node or what?
my heuristics are good, i'm quite sure thats not the problem, the problem is like you mentioned, the tree is too complex.
I'll try to find a better pruning algorithm, i just freaked out when the AB pruning failed so hard (well it's the fault of the game, it still improves the search by aprx 70-80% so it isn't that bad, but that remaining 20% of the tree is still too big) and that's why i wanted to find/try other methods.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List