Soc2012 Talbot Pierre Refactor Recruitment Algorithm - Revision history

Esr: Hide historical instance of "SVN" from mediawiki search to avoid false positives.

2013-03-20T19:55:33Z

Hide historical instance of "SVN" from mediawiki search to avoid false positives.

Trademark: /* 4.1) Did you select a project from our list? If that is the case, what project did you select? What do you want to especially concentrate on? */

2012-04-17T20:17:31Z

‎4.1) Did you select a project from our list? If that is the case, what project did you select? What do you want to especially concentrate on?

Ejls: SummerOfCodeIdeas-fication

2012-04-16T02:57:33Z

SummerOfCodeIdeas-fication

Trademark at 20:02, 15 April 2012

2012-04-15T20:02:18Z

Trademark: /* Villages analysis */

2012-04-15T14:33:19Z

‎Villages analysis

Trademark: /* Latest Edit */

2012-04-15T14:08:07Z

‎Latest Edit

Trademark: /* Recruiting better units */

2012-04-15T13:51:28Z

‎Recruiting better units

Trademark: /* Unit objectives */

2012-04-15T13:44:49Z

‎Unit objectives

Trademark: /* Villages analysis */

2012-04-15T13:39:59Z

‎Villages analysis

Trademark at 13:39, 15 April 2012

2012-04-15T13:39:11Z

@@ Line 142: / Line 142: @@
 I started the campaign and I finished few scenarios. I played about 5 hours. I also played online in a custom game. I'm not good enough to play online as I don't know the units and the strategy used (I've started to watch game replay of experienced gamers).
-====2.6) If you have contributed any patches to Wesnoth, please list them below. You can also list patches that have been submitted but not committed yet and patches that have not been specifically written for GSoC. If you have gained commit access to our SVN (during the evaluation period or earlier) please state so.====
+====2.6) If you have contributed any patches to Wesnoth, please list them below. You can also list patches that have been submitted but not committed yet and patches that have not been specifically written for GSoC. If you have gained commit access to our S&shy;&shy;V&shy;&shy;N (during the evaluation period or earlier) please state so.====
 A bug: [https://gna.org/bugs/?19538 Bug #19538].
@@ Line 620: / Line 620: @@
 ====5.1) Are you familiar with any of the following tools or languages?====
-* Subversion: Yes, I used it during my previous GSoC. For my personal projects, I'm using git.
+* Sub&shy;&shy;version: Yes, I used it during my previous GSoC. For my personal projects, I'm using git.
 * C++: My level is correct, I can easily debug and understand the concept and features of this language.
 * STL, Boost, Sdl: I know a large part of the STL and some libraries from Boost (MPL, Phoenix, Range,...). I used very few the SDL during a C project.

@@ Line 184: / Line 184: @@
 ====4.1) Did you select a project from our list? If that is the case, what project did you select? What do you want to especially concentrate on?====
-I'll answer to be general and than specific. Firstly, I choose this organisation because I'd to be a game programmer and I love strategy game. I choose to do my proposal on the AI part. I'm interested by a project in your list: "AI: Refactor Recruitment Algorithm".
+I'll answer to be general and than specific. Firstly, I choose this organisation because I'd like to be a game programmer and I love strategy game. I choose to do my proposal on the AI part. I'm interested by a project in your list: "AI: Refactor Recruitment Algorithm".
 ====4.2) If you have invented your own project, please describe the project and the scope.====

@@ Line 40: / Line 40: @@
 =IRC=
 trademark
 =SoC Application=
 Submitted to google

@@ Line 40: / Line 40: @@
 =IRC=
 trademark
 =Questionnaire=

← Older revision		Revision as of 14:33, 15 April 2012
Line 466:		Line 466:

	Furthermore, the villages which are already ours are removed from V. And the distance to go to the villages which belong to the enemy or in a enemy zone are doubled only if enemies are around those villages.		Furthermore, the villages which are already ours are removed from V. And the distance to go to the villages which belong to the enemy or in a enemy zone are doubled only if enemies are around those villages.
		+
		+	The maximum edge on a path indicate us the unit to recruit, we are not forced to recruit a unit who is a scout if it's more useful and can do the job of the scout and fighting well.

	A problem could appear. It's not our responsibility to move the unit and to follow the path indicated. So even if we recruit units for a specific objective, we cannot be sure that other AI will understand it this way... We need a way to communicate, and it's bring us to the next improvement: "Unit's objectives".		A problem could appear. It's not our responsibility to move the unit and to follow the path indicated. So even if we recruit units for a specific objective, we cannot be sure that other AI will understand it this way... We need a way to communicate, and it's bring us to the next improvement: "Unit's objectives".

@@ Line 20: / Line 20: @@
 Edit 14/04:
-* Add a section in "Recruiting better units": Group analysis
+* Add a section in "Recruiting better units": Group analysis.
 =Description=

@@ Line 363: / Line 363: @@
 =====Recruiting better units=====
-The recruitment is the basic of every strategies and so we must first analyse the map.
+The recruitment is the basic of every strategies and so we must first analyse the unit, the terrain, the villages on the map to take the best decisions.
 ======Groups analysis======

@@ Line 466: / Line 466: @@
 A problem could appear. It's not our responsibility to move the unit and to follow the path indicated. So even if we recruit units for a specific objective, we cannot be sure that other AI will understand it this way... We need a way to communicate, and it's bring us to the next improvement: "Unit's objectives".
-======Unit objectives======
+======Unit's objectives======
-Each units should have a goal, for example, getting a village, kill a specific category of units, block others (these ideas join other proposals so we'll need to work and discuss together about these parts). This would be implemented such a "hint" member filled during the recruitment process and modify if needed during the next phase. With this hint, an unit is never without goals and further decisions are easier to take. It's a good way to have more than one turn ahead.
+Each units should have a goal, for example, getting a village, kill a specific category of units, block others (these ideas join other proposals so we'll need to work and discuss together about these parts). It will be implemented such a "hint" member filled during the recruitment process and modify if needed during the next phases and by the other AI. With this hint, an unit is never without goals and further decisions are easier to take. It's a good way to have more than one turn ahead.
 =====WML recruiting parameterisation=====

@@ Line 459: / Line 459: @@
 # We initialise a graph G containing only the castle's tiles node.
 # In a priority queue V, we sort all the villages by the distance (the distance sum from each available castle's tiles).
-# While V is not empty:
+# While V is not empty: we connect the village extracted to the closest node in G.
 # G contains all the paths from each castle's tiles.

← Older revision		Revision as of 13:39, 15 April 2012
Line 454:		Line 454:

	We calculate paths which maximize the number of villages that scouts can reach in the minimum turns. The paths don't contain a same village.		We calculate paths which maximize the number of villages that scouts can reach in the minimum turns. The paths don't contain a same village.
		+
		+	From each vacant tiles on the castle, a path is calculated and goes by all the villages on the map. It's an optimisation problem: the travelling salesman. We don't want a village in more than one path and we apply the following algorithm:
		+
		+	# We initialise a graph G containing only the castle's tiles node.
		+	# In a priority queue V, we sort all the villages by the distance (the distance sum from each available castle's tiles).
		+	# While V is not empty:
		+	# We connect the village extracted to the closest node in G.
		+	# G contains all the paths from each castle's tiles.
		+
		+	Furthermore, the villages which are already ours are removed from V. And the distance to go to the villages which belong to the enemy or in a enemy zone are doubled only if enemies are around those villages.
		+
		+	A problem could appear. It's not our responsibility to move the unit and to follow the path indicated. So even if we recruit units for a specific objective, we cannot be sure that other AI will understand it this way... We need a way to communicate, and it's bring us to the next improvement: "Unit's objectives".

	======Unit objectives======		======Unit objectives======