Changeset 136 for trunk/Languages
- Timestamp:
- Jul 6, 2017, 12:04:23 PM (7 years ago)
- Location:
- trunk/Languages
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/Languages/xtactics.cs.po
r135 r136 9 9 "MIME-Version: 1.0\n" 10 10 "Content-Transfer-Encoding: 8bit\n" 11 "X-Generator: Poedit 2.0. 1\n"11 "X-Generator: Poedit 2.0.2\n" 12 12 "Language: cs\n" 13 13 … … 531 531 "xTactics is a risk based strategic game. Main focus of the game is to offer player various possibilities to configure game conditions. Map for game is generated randomly for each play. Game is multiplayer so single player can play with other human opponents or with many computer opponents.\n" 532 532 "\n" 533 "Each cell has defined number of units which can be instructed to attack enemy or neutral adj ecent cells. Units can also defend against enemy attach from adjecent cells. You can move units inside your territory. \n"533 "Each cell has defined number of units which can be instructed to attack enemy or neutral adjacent cells. Units can also defend against enemy attach from adjacent cells. You can move units inside your territory. \n" 534 534 "Number of units in cells grows by square root of number of units. More units cell contains, more units is added each turn. Maximum number to which units grow is 99. Cell can have more units but excessive cells will die gradually every turn to balance to number 99.\n" 535 535 "\n" 536 "Resolution of attac h of units is determined by rule similar to one which is used in Risk game. Battle consist of several fights. Each fight attacker can use up to 3 units and defender up to 2 units. Number of units for each side determine number of dices. Both sides roll their dices and order them in descending order.Each side takes one dice with highest value. One who has dice with higher value wins. In case of tie, defender wins. Loser lose its unit and another pair of dices is evaluated. This process is calculated automatically and for each planned attack win probability is displayed.\n"536 "Resolution of attack of units is determined by rule similar to one which is used in Risk game. Battle consist of several fights. Each fight attacker can use up to 3 units and defender up to 2 units. Number of units for each side determine number of dices. Both sides roll their dices and order them in descending order. Each side takes one dice with highest value. One who has dice with higher value wins. In case of tie, defender wins. Loser lose its unit and another pair of dices is evaluated. This process is calculated automatically and for each planned attack win probability is displayed.\n" 537 537 msgstr "" 538 538 "xTactics je strategická hra založena na hře Risk. Hlavní zaměření hry je nabídnout hráči různé možnosti k nastavení podmínek hry. Mapa hry je generována náhodně pro každou hru. Hra je pro více hráčů takže jeden hráč může hrát s dalšími lidskými protivníky nebo s mnoha počítačovými protivníky.\n" -
trunk/Languages/xtactics.po
r135 r136 516 516 "xTactics is a risk based strategic game. Main focus of the game is to offer player various possibilities to configure game conditions. Map for game is generated randomly for each play. Game is multiplayer so single player can play with other human opponents or with many computer opponents.\n" 517 517 "\n" 518 "Each cell has defined number of units which can be instructed to attack enemy or neutral adj ecent cells. Units can also defend against enemy attach from adjecent cells. You can move units inside your territory. \n"518 "Each cell has defined number of units which can be instructed to attack enemy or neutral adjacent cells. Units can also defend against enemy attach from adjacent cells. You can move units inside your territory. \n" 519 519 "Number of units in cells grows by square root of number of units. More units cell contains, more units is added each turn. Maximum number to which units grow is 99. Cell can have more units but excessive cells will die gradually every turn to balance to number 99.\n" 520 520 "\n" 521 "Resolution of attac h of units is determined by rule similar to one which is used in Risk game. Battle consist of several fights. Each fight attacker can use up to 3 units and defender up to 2 units. Number of units for each side determine number of dices. Both sides roll their dices and order them in descending order.Each side takes one dice with highest value. One who has dice with higher value wins. In case of tie, defender wins. Loser lose its unit and another pair of dices is evaluated. This process is calculated automatically and for each planned attack win probability is displayed.\n"521 "Resolution of attack of units is determined by rule similar to one which is used in Risk game. Battle consist of several fights. Each fight attacker can use up to 3 units and defender up to 2 units. Number of units for each side determine number of dices. Both sides roll their dices and order them in descending order. Each side takes one dice with highest value. One who has dice with higher value wins. In case of tie, defender wins. Loser lose its unit and another pair of dices is evaluated. This process is calculated automatically and for each planned attack win probability is displayed.\n" 522 522 msgstr "" 523 523
Note:
See TracChangeset
for help on using the changeset viewer.