![]() ![]() The default values are initially displayed for all new games. Game options and Map generator options are no longer automatically saved and loaded.Units in Europe are no longer included in the list of possible active units. ![]() Enabled generation of rivers that are only two tiles long (the previous limit was three).The number of rivers generated can now be properly controlled using the "Number of rivers" map generator option even when changing map sizes and/or amount of mountains.Great rivers (ocean like, navigable by ships only) are no longer generated by default, but can still be generated if enabled using the Map Generator Options.Added the mod "Hitpoints and Combat" that adds hitpoints and ranged combat to the game.Jesuit Missionary can now recommision itself in colonies without a church.The standard panel background image is now both brighter and without obvious tiling artifacts on larger screens.Updated the old tracks with new updated versions.User visible changes since version 1.0.0 Music In addition, we have included a new mod that adds hitpoints and ranged combat:Īll savegames from 0.12.0 and up should continue working with 1.1.0. Six new musical tracks have been added to the game. We have been working on the main parts of FreeCol since our last release. lb - An optional LogBuilder to log to.The next official release of FreeCol is finally ready! searchHeuristic - An optional SearchHeuristic. carrier - An optional naval carrier Unit to use. maxTurns - The maximum number of turns the given Responsible for determining the path cost. goalDecider - The object responsible for determining whether a start - The Tile to start the search from. Parameters: unit - The Unit to find a path for. Test and O(log N) for remove-best and insertions. HashMap for membership tests and a PriorityQueue for getting the node ![]() The data structure for the open list is a combined structure: using a If the SearchHeuristic is not supplied, then the algorithmĭegrades gracefully to Dijkstra's algorithm. Order to avoid both of the HashMaps currently being used to Improved by having the visited attribute stored on each Tile in Using A* with a List (closedMap) for marking the visited nodesĪnd using a PriorityQueue (openMapQueue) for getting the nextĮdge with the least cost. Searches for a path to a goal determined by the given
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |