Skip to main content
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
replaced http://gamedev.stackexchange.com/ with https://gamedev.stackexchange.com/
Source Link

Is Integer Linear Programming a viable solution for a turn based game AI?

My current AI solution uses an ILP solver. If you are unfamiliar with ILP, it uses a collection of Booleans to find most optimal solution to a linear problem.

I'm concerned about fluctuations in performance and I"m also thinking of portability. I am using C++ to prototype. I have access to an ILP solver that works well with it. I don't know if I"ll find one that I can use on portable devices. I'm unsure if can rely on the computation time being reasonable with an N large enough to get the results I"m planning for.

I am wondering if anyone used this technique (ILP based AI) and would advice against it or in favor of it. Also are there any other (portable and effective) optimization tools that could be used for a similar result? I read about NegaScout but I did not find a book or tutorial that could provide me with a deep understanding of it.

I also read this question which did not help: Implement Negascout Algorithm with stackImplement Negascout Algorithm with stack

Is Integer Linear Programming a viable solution for a turn based game AI?

My current AI solution uses an ILP solver. If you are unfamiliar with ILP, it uses a collection of Booleans to find most optimal solution to a linear problem.

I'm concerned about fluctuations in performance and I"m also thinking of portability. I am using C++ to prototype. I have access to an ILP solver that works well with it. I don't know if I"ll find one that I can use on portable devices. I'm unsure if can rely on the computation time being reasonable with an N large enough to get the results I"m planning for.

I am wondering if anyone used this technique (ILP based AI) and would advice against it or in favor of it. Also are there any other (portable and effective) optimization tools that could be used for a similar result? I read about NegaScout but I did not find a book or tutorial that could provide me with a deep understanding of it.

I also read this question which did not help: Implement Negascout Algorithm with stack

Is Integer Linear Programming a viable solution for a turn based game AI?

My current AI solution uses an ILP solver. If you are unfamiliar with ILP, it uses a collection of Booleans to find most optimal solution to a linear problem.

I'm concerned about fluctuations in performance and I"m also thinking of portability. I am using C++ to prototype. I have access to an ILP solver that works well with it. I don't know if I"ll find one that I can use on portable devices. I'm unsure if can rely on the computation time being reasonable with an N large enough to get the results I"m planning for.

I am wondering if anyone used this technique (ILP based AI) and would advice against it or in favor of it. Also are there any other (portable and effective) optimization tools that could be used for a similar result? I read about NegaScout but I did not find a book or tutorial that could provide me with a deep understanding of it.

I also read this question which did not help: Implement Negascout Algorithm with stack

Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
deleted 294 characters in body; edited tags
Source Link
AturSams
  • 10.6k
  • 1
  • 35
  • 60

I am attempting to findIs Integer Linear Programming a good AIviable solution for a turn based game. The most effective AI?

My current AI solution I was able to find and implement so far uses an ILP solver. Basically each possible action in each turn amongst the next N ( == some reasonably small number) turns is a Boolean and the goal is to maximize the success (damage caused - damage sustained) which is calculated from the expectancy values of each move used. LikeIf you may imagine we are only checking what happens in the next N turns assuming both parties choose optimal moves. Each selectionunfamiliar with ILP, it uses a collection of moves affects and possibly constraints other possible movesBooleans to find most optimal solution to a linear problem.

The problems I'm concerned with isabout fluctuations in performance and I"m also thinking of portability. I am using C++ to prototype and. I have access to an ILP solver that works well with it. I don't know if I"ll find one that I can use on a portable device as easilydevices. Also I'm not sureunsure if can always rely on the computation time being reasonable and thewith an N being biglarge enough to get the results I"m planning for. 

I am wondering if anyone used this technique (ILP based AI) and would advice against it or in favor of it. Also are there any other options(portable and effective) optimization tools that could be used for a similar result? I read about NegaScout but I did not find a book or tutorial that could provide me with a deep understanding of it.

I also read this question which did not help: Implement Negascout Algorithm with stack

I am attempting to find a good AI solution for a turn based game. The most effective solution I was able to find and implement so far uses an ILP solver. Basically each possible action in each turn amongst the next N ( == some reasonably small number) turns is a Boolean and the goal is to maximize the success (damage caused - damage sustained) which is calculated from the expectancy values of each move used. Like you may imagine we are only checking what happens in the next N turns assuming both parties choose optimal moves. Each selection of moves affects and possibly constraints other possible moves.

The problems I'm concerned with is performance and portability. I am using C++ to prototype and I have access to an ILP solver that works well with it. I don't know if I"ll find one that I can use on a portable device as easily. Also I'm not sure if can always rely on the computation time being reasonable and the N being big enough. I am wondering if anyone used this technique and would advice against it or in favor of it. Also are there any other options that could be used for a similar result? I read about NegaScout but I did not find a book or tutorial that could provide me with a deep understanding of it.

I also read this question which did not help: Implement Negascout Algorithm with stack

Is Integer Linear Programming a viable solution for a turn based game AI?

My current AI solution uses an ILP solver. If you are unfamiliar with ILP, it uses a collection of Booleans to find most optimal solution to a linear problem.

I'm concerned about fluctuations in performance and I"m also thinking of portability. I am using C++ to prototype. I have access to an ILP solver that works well with it. I don't know if I"ll find one that I can use on portable devices. I'm unsure if can rely on the computation time being reasonable with an N large enough to get the results I"m planning for. 

I am wondering if anyone used this technique (ILP based AI) and would advice against it or in favor of it. Also are there any other (portable and effective) optimization tools that could be used for a similar result? I read about NegaScout but I did not find a book or tutorial that could provide me with a deep understanding of it.

I also read this question which did not help: Implement Negascout Algorithm with stack

Source Link
AturSams
  • 10.6k
  • 1
  • 35
  • 60

Integer linear program solver based AI

I am attempting to find a good AI solution for a turn based game. The most effective solution I was able to find and implement so far uses an ILP solver. Basically each possible action in each turn amongst the next N ( == some reasonably small number) turns is a Boolean and the goal is to maximize the success (damage caused - damage sustained) which is calculated from the expectancy values of each move used. Like you may imagine we are only checking what happens in the next N turns assuming both parties choose optimal moves. Each selection of moves affects and possibly constraints other possible moves.

The problems I'm concerned with is performance and portability. I am using C++ to prototype and I have access to an ILP solver that works well with it. I don't know if I"ll find one that I can use on a portable device as easily. Also I'm not sure if can always rely on the computation time being reasonable and the N being big enough. I am wondering if anyone used this technique and would advice against it or in favor of it. Also are there any other options that could be used for a similar result? I read about NegaScout but I did not find a book or tutorial that could provide me with a deep understanding of it.

I also read this question which did not help: Implement Negascout Algorithm with stack