Body: <p>In this game, a matrix with size N x M is given (10&lt;=N,M&lt;=15). There a three main type of value in the matrix:</p>
  <ul>
  <li>A integer show how many gold is it</li>
  <li>Char 'D' show obstacle</li>
  <li>Char 'S' show shield (which can obtain to get through obstacle, once obtained can be used the whole match, there only 2 shield). Shield can not protect player when two players collide.
  There are only two player. Player move simultaneously.
  There're about 50 to 70 turn then the game will end.
  There are chance treasure appear on the map (only once) with value 3/4 * d to 5/4 * d with d is the difference in gold of two player at that moment.</li>
  </ul>
  <p>Find a way to maximize the gold. I've tried Minimax but it's seem not verry efficient. Is there any better approach to this problem?</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-04-12T07:54:32.770Z
Comments.Text: Welcome to AI Stack Exchange. This looks on topic, but the title could be better. A good title is self-contained. So I'm going to attempt to rewrite it for you. If you don't like what I do,you can use [edit] to go back or improve it further
Comments.UserDisplayName: Neil Slater
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-04-12T08:23:46.447Z
Comments.Text: As a two-player game, what is the main objective? Maximimise total gold in colaboration, adding both players? For competing players, getting more gold than the other player, or getting the highest amount of gold possible (those are similar, but not the same objective)?
Comments.UserDisplayName: Neil Slater
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-04-12T15:34:22.323Z
Comments.Text: minmax in perfect information game is guaranteed to converge to a nash equilibrium if you are in a zero-sum games, but i can't see anything on the rewards/utilities
Comments.UserDisplayName: Alberto
Tags: <reinforcement-learning><minimax>
Title: Two player grid-based game, minimax not good, what to try?
UserDisplayName: Parrottos 
ThreadText: # Two player grid-based game, minimax not good, what to try?
  
  (Asked by: username_0 on 2024-04-12)
  
  In this game, a matrix with size N x M is given (10<=N,M<=15). There a three main type of value in the matrix:
  
  * A integer show how many gold is it
  * Char 'D' show obstacle
  * Char 'S' show shield (which can obtain to get through obstacle, once obtained can be used the whole match, there only 2 shield). Shield can not protect player when two players collide.
    There are only two player. Player move simultaneously.
    There're about 50 to 70 turn then the game will end.
    There are chance treasure appear on the map (only once) with value 3/4 \* d to 5/4 \* d with d is the difference in gold of two player at that moment.
  
  Find a way to maximize the gold. I've tried Minimax but it's seem not verry efficient. Is there any better approach to this problem?
  
  **Tags:** reinforcement-learning, minimax
  
  > **Comments:**
  > **username_1**: Welcome to AI Stack Exchange. This looks on topic, but the title could be better. A good title is self-contained. So I'm going to attempt to rewrite it for you. If you don't like what I do,you can use [edit] to go back or improve it further  
  > **username_1**: As a two-player game, what is the main objective? Maximimise total gold in colaboration, adding both players? For competing players, getting more gold than the other player, or getting the highest amount of gold possible (those are similar, but not the same objective)?  
  > **username_2**: minmax in perfect information game is guaranteed to converge to a nash equilibrium if you are in a zero-sum games, but i can't see anything on the rewards/utilities  
  
  ---
  
  ## 0 answers
  
  