FormulaAIBaseAI - Revision history

Celtic Minstrel: Candidate for deletion

2022-11-16T03:19:18Z

Candidate for deletion

2016-02-23T13:54:56Z

‎My commits: add AI category

2013-03-20T23:34:43Z

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

2008-04-11T21:51:17Z

‎Progress

2008-04-11T21:49:21Z

‎Idea

2008-04-11T21:48:40Z

‎My commits

2008-04-11T21:47:06Z

‎Progress

2008-04-11T21:46:47Z

‎Progress

2008-04-11T21:35:48Z

‎Idea

2008-04-11T21:35:30Z

‎Idea

← Older revision		Revision as of 13:54, 23 February 2016
Line 238:		Line 238:
	Besides above, I have been working on improving the [[FormulaAI]] documentation.		Besides above, I have been working on improving the [[FormulaAI]] documentation.

		+	[[Category:AI]]
	[[Category:Summer of Code]]		[[Category:Summer of Code]]

@@ Line 56: / Line 56: @@
 *Practical considerations
 **Are you familiar with any of the following tools?
-***Subversion
+***Sub&shy;&shy;version
 ****Yes, about 2-year experience.
 ***C++

@@ Line 210: / Line 210: @@
 These things are needed to be done in order to implement recruting algorithm for an AI:
-* Add support for a 'map' type to the Formula System, and implement operator [] (done - please look at [[My commits]])
+* Add support for a 'map' type to the Formula System, and implement operator [] ([[#My commits|commited]])
 * Implement needed functions (names may change, some more functions may be added): (in progress)

@@ Line 202: / Line 202: @@
 * Execute recruit_list_builder(): use result of eval(), to determine how many attackers/defenders we need and build output map with needed units, and information how important these units are.
-* Unit_choser() - compare units that we already have with list of units that we need, chose unit that is best one to get now.
+* Unit_chooser() - compare units that we already have with list of units that we need, chose unit that is best one to get now.
 This is idea for now. Building a good recruitment algorithm will take much time, and require a lot of testing. Many of chosed now solutions may change.

@@ Line 234: / Line 234: @@
 * More powerful formula command line (you can now move, recruit and attack using it): [http://svn.gna.org/viewcvs/wesnoth?rev=25087&view=rev] [http://svn.gna.org/viewcvs/wesnoth?rev=25089&view=rev]
 * Added support for 'map' to the Formula System [http://svn.gna.org/viewcvs/wesnoth?rev=25713&view=rev]
-* Implemented operator [], and two functions which operate on a map [http://svn.gna.org/viewcvs/wesnoth?rev=25741&view=rev]
+* Implemented operator [], and two functions which operate on a map [http://svn.gna.org/viewcvs/wesnoth?rev=25741&view=rev] [http://svn.gna.org/viewcvs/wesnoth?rev=25744&view=rev]
 Besides above, I have been working on improving the [[FormulaAI]] documentation.
 [[Category:Summer of Code]]

← Older revision		Revision as of 21:46, 11 April 2008
Line 207:		Line 207:

	=== Progress ===		=== Progress ===
		+
		+	These things are needed to be done in order to implement recruting algorithm for an AI:
		+
		+	* Add support for a 'map' type to the Formula System, and implement operator [] (done - please look at [[My Commits]])
		+
		+	* Implement needed functions (names may change, some more functions may be added): (in progress)
		+	**eval() and evaluate()
		+	**units_effectivness()
		+	**evaluate_attackers()
		+	**evaluate_defenders()
		+	**recruit_list_builder()
		+	**unit_chooser()
		+	**units_stats_eval()
		+	**villages_eval()
		+
		+	* Test functions and outcomes, tweak algorithm in order to get best results.

	== My commits ==		== My commits ==

@@ Line 204: / Line 204: @@
 * Unit_choser() - compare units that we already have with list of units that we need, chose unit that is best one to get now.
-This is idea for now. Building a good recruitment algorithm will take much time, and require a lot of testing. Many of the chosed now solutions may change.
+This is idea for now. Building a good recruitment algorithm will take much time, and require a lot of testing. Many of chosed now solutions may change.
 === Progress ===