User:Zazweda - Revision history

Zazweda: /* Project split */

2013-05-14T06:23:00Z

‎Project split

Zazweda at 11:24, 4 May 2013

2013-05-04T11:24:46Z

Zazweda: /* Project split */

2013-05-04T10:09:16Z

‎Project split

Zazweda: /* Project split */

2013-05-04T10:08:39Z

‎Project split

Zazweda: /* Project split */

2013-05-02T22:50:12Z

‎Project split

Zazweda: /* Project split */

2013-05-02T22:48:55Z

‎Project split

Zazweda: /* Micro AIs for defense and on the fly mods */

2013-05-02T21:57:01Z

‎Micro AIs for defense and on the fly mods

Crab: /* Description */ (remove unnecessary link)

2013-04-26T11:52:29Z

‎Description: (remove unnecessary link)

Zazweda: /* Description */

2013-04-23T13:41:43Z

‎Description

Zazweda at 13:36, 23 April 2013

2013-04-23T13:36:11Z

@@ Line 55: / Line 55: @@
 <h4>Risk detection algorithm</h4>
-Risk detection would simply simulate next turn and take some criteria into account.
+Risk detection would simply simulate next turn and take some criteria into account. This could be improved using the markov chains to predict the next steps.
-Number of possible attacks, risk of death, risk of losing an important terrain, risk of having an important target attacked.
+Criterias could be : Number of possible attacks, risk of death, risk of losing an important terrain, risk of having an important target attacked.
 It would finally returns a value representing the "risk" of the CA
@@ Line 81: / Line 81: @@
 For each of this CAs it would try to estimate the risks that the enemy move could provoke on next turn. This risk is defined in the "risk detection" algorithm.
-<h4> MAIs </h4>
+<h4> MAIs and extCAs </h4>
 ==Schedule==

@@ Line 81: / Line 81: @@
 For each of this CAs it would try to estimate the risks that the enemy move could provoke on next turn. This risk is defined in the "risk detection" algorithm.
+<h4> MAIs </h4>
 ==Schedule==

← Older revision		Revision as of 10:09, 4 May 2013
Line 82:		Line 82:


−	<h4>~~Schedule~~</h4>	+	==Project split==
		+
		+	<h4>Refactoring of the attack algorithm</h4>
		+
		+	Modificating the attack algorithm is useful mainly to defend important AIs unit or zone. This would go through the "good position" detection (detailed in the section of the same name) and defending experimented unit or useful units against the enemy(ies) taking its own "value" into account.
		+
		+	This would allow to check if there is an attack move that is good enough in term of "future" anticipation. If there is no good attack move, it would go to defense algorithm
		+
		+	<h4>Defense algorithm</h4>
		+
		+	The defense algorithm would allow the AI to think about the future actions.
		+	If no good attack move is found it goes defending. This would be done by moving to "good position" or in front of important unit. The good position for defense is detailed in the section good position algo.
		+	If there is no way to protect efficiently a very important unit (through a line of blocking unit per exemple) it would simply try to kill or weaken the highest threat level enemy (detected by the risk detection algorithm).
		+
		+	<h4>Estimation algorithm</h4>
		+
		+	This algorithm estimates the next turn possibilities according to given CAs.
		+	It would take each CA and run a risk detection on it. It would then pick the one with the lowest RISK-DEFENSE_Possibilites. Defense possiblities represents a good position or for example a home (which would heal next turn) or a high defense terrain.
		+
		+	It would finally return the CAs it estimates best for the unit.
		+
		+	<h4>Risk detection algorithm</h4>
		+
		+	Risk detection would simply simulate next turn and take some criteria into account.
		+	Number of possible attacks, risk of death, risk of losing an important terrain, risk of having an important target attacked.
		+	It would finally returns a value representing the "risk" of the CA
		+
		+	<h4>Good position detection algorithm</h4>
		+
		+	A good position may be 2 things. For attack it is where your defense score is the best and enemy's the lowest. For defense it is a little different. If AI anticipates next turn it has to take into attack where its own defense will be the best, but also where enemy defense will be the lowest. It will then try to find the terrain with the highest defense for him and with hex around it which have low defense score for the enemy.
		+
		+	The terrain value would be calculated through the enemy kind in the first place an improvement could be to take the current threatening unit into account.
		+
		+	Then other "good position" may be more dangerous but valuable position : control of a castle, control of a house or even a bridge.
		+
		+	<h4>High priority unit algorithm</h4>
		+
		+	The AI high priority unit would be its own leader, high exp unit, or powerful units against enemy kind (improvement could take into account the current threatening units). It may also be depending on the number of house per exemple, its fast moving units (when it needs more money).
		+
		+	The enemy highest priority unit are pretty much the same but reversed for the quick units (if I have a lot of house I don't want some horse to steal them.) and powerful unit against my kind (which would be attacked by counter unit).
		+
		+	<h4>Detection of the next turn potential actions</h4>
		+
		+	The detection of the next turn actions has a big part in the AI CAs. It would be done through a 2 steps algorithm :
		+
		+	Estimate the best CAs according to the refactored estimation algorithm (attack or defense move), this would select the N best CAs (1 2 3 or more according to tests).
		+
		+	For each of this CAs it would try to estimate the risks that the enemy move could provoke on next turn. This risk is defined in the "risk detection" algorithm.
		+
		+
		+	==Schedule==

	=Description=		=Description=

@@ Line 42: / Line 42: @@
 <h4>Defense algorithm</h4>
 <h4>Estimation algorithm</h4>
 <h4>Risk detection algorithm</h4>
 <h4>Good position detection algorithm</h4>
 <h4>High priority unit algorithm</h4>
 <h4>Detection of the next turn potential actions</h4>
-The detection of the next turn actions has a big part in the AI CAs. It would be done through 2 a 2 steps algorithm :
+The detection of the next turn actions has a big part in the AI CAs. It would be done through a 2 steps algorithm :
 Estimate the best CAs according to the refactored estimation algorithm (attack or defense move), this would select the N best CAs (1 2 3 or more according to tests).
 For each of this CAs it would try to estimate the risks that the enemy move could provoke on next turn. This risk is defined in the "risk detection" algorithm.
 =Description=

@@ Line 36: / Line 36: @@
 <h4>Refactoring of the attack algorithm</h4>
-Modificating the attack algorithm is useful mainly to defend important AIs unit or zone. This would go through the "good position" detection (detailed in the section of the same name) and defending experimented unit or usefull units against the enemy(ies).
+Modificating the attack algorithm is useful mainly to defend important AIs unit or zone. This would go through the "good position" detection (detailed in the section of the same name) and defending experimented unit or useful units against the enemy(ies) taking its own "value" into account.
 This would allow to check if there is an attack move that is good enough in term of "future" anticipation. If there is no good attack move, it would go to defense algorithm

← Older revision		Revision as of 22:48, 2 May 2013
Line 33:		Line 33:

	==Project split==		==Project split==
		+
		+	<h4>Refactoring of the attack algorithm</h4>
		+
		+	Modificating the attack algorithm is useful mainly to defend important AIs unit or zone. This would go through the "good position" detection (detailed in the section of the same name) and defending experimented unit or usefull units against the enemy(ies).
		+
		+	This would allow to check if there is an attack move that is good enough in term of "future" anticipation. If there is no good attack move, it would go to defense algorithm
		+
		+	<h4>Defense algorithm</h4>
		+
		+	<h4>Estimation algorithm</h4>
		+
		+	<h4>Risk detection algorithm</h4>
		+
		+	<h4>Good position detection algorithm</h4>
		+
		+	<h4>High priority unit algorithm</h4>
		+
		+	<h4>Detection of the next turn potential actions</h4>
		+
		+	The detection of the next turn actions has a big part in the AI CAs. It would be done through 2 a 2 steps algorithm :
		+
		+	Estimate the best CAs according to the refactored estimation algorithm (attack or defense move), this would select the N best CAs (1 2 3 or more according to tests).
		+
		+	For each of this CAs it would try to estimate the risks that the enemy move could provoke on next turn. This risk is defined in the "risk detection" algorithm.

	=Description=		=Description=

← Older revision		Revision as of 21:57, 2 May 2013
Line 31:		Line 31:

	On the fly modifications would be useful to determine in which case attacking or defending is better according to the current state of the game (for exemple if AI has advantage with more unit or more house it can be more aggressive).		On the fly modifications would be useful to determine in which case attacking or defending is better according to the current state of the game (for exemple if AI has advantage with more unit or more house it can be more aggressive).
		+
		+	==Project split==

	=Description=		=Description=

@@ Line 35: / Line 35: @@
 <h4>Zazweda - Total defense Strategy</h4>
-The defense project would include taking more information and probabilities into account (next turn for example), a more detailed description can be found here :
+The defense project would include taking more information and probabilities into account (next turn for example).
 =IRC=

@@ Line 1: / Line 1: @@
 {{SoC2013Student}}
 [[Category:SoC Ideas AI Defense Strategies 2013]]
 ==Overview==
@@ Line 34: / Line 31: @@
 On the fly modifications would be useful to determine in which case attacking or defending is better according to the current state of the game (for exemple if AI has advantage with more unit or more house it can be more aggressive).
 =IRC=