Tower Defense

game king-of-the-hill javascript

Tower Defense (Abandoned)

game king-of-the-hill javascript

Anyone is free to take over this challenge and fork as necessary. Just give me credit ;)

View it here | Chat

#Tower Defense

(Work in Progress)

[Picture will go here]

#The Challenge

There will be two types of submissions: Defenders and Invaders. These two types of submissions will face off against each other.

The playfield is a 1-dimensional "grid" that is 100 spaces long. Towers can be placed along this playfield, which will do damage to the invader that is farthest along within its range. Both sides will become stronger between rounds. The game ends after 100 invaders have made it through the defender's playfield.

  The game will be simulated deterministically in a turn based fashion. Invaders cannot pass through each other and only one can be on each space. They move forward one space each turn, if possible, resolved farthest-along-first.

Sandbox Note: some experimentation is going to be done on symmetric submissions where each side controls a defender-invader pair.

##Defenders

The objective of the defender is to last as many turns as possible by keeping invaders from getting across the playfield.

At the beginning of the game, the defender will have 50 gold. They have the following options available to them, each costing 10 gold:

• Place a turret on the playfield. Turrets initially have a range of 1 and do 1 damage (1 power) and fire once per turn.
• Place a stunner on the playfield. Stunners do not deal damage, have an initial range of 0, but prevent targeted invaders from moving for a number of turns equal to their power. After firing, they have a cooldown time of power + 1. They will not fire at invader that is currently stunned.
• Place a bomb on the playfield. Bombs have an initial range of 2 and power of 1, but damage all invaders in range when triggered. They have a cooldown of 5 turns before being able to fire again. They are only triggered by an invader on the same index as the bomb.
• Increase a tower's power by 1. Power linearly affects damage for bombs and turrets and stun time (but also cooldown time) for stunners
• Increase a tower's range by 1.

There is no set upper bound on power or range. (Though expanding range beyond the boundaries of the playfield is pointless)

Only one building can be placed on each space. When a building is placed or upgraded, it cannot fire or be upgraded for 10 turns. Buildings may also be removed to regain half the gold invested into them.

  1 Gold is earned once every 10 turns.

One action may be taken each turn.

###Range

Building range refers to the number of spaces on either side of the building that can be reached by the turret.

... | | |A| | | | |B| | | | ... ... 5-4-3-2-1-T-1-2-3-4-5 ... 

A turret is represented by T and there are invaders A and B. If the turret had a range of 0, it would only be able to fire at the space immediately in front of it. If it had a range of 2, it would be able to reach invader B only. If it has a range of 3, it would be able to reach both invaders A and B.

##Invaders

The objective of the invaders is to get 100 invaders through the playfield in as few turns as possible.

The invaders start out with 0 gold. Every 10 turns, some amount of gold is earned. The amount earned every 10 turns starts at 10 gold and increases by floor(log10(turnNumber) - 1) every 100 turns.

You are limited on the maximum stats. You start off unable to boost stats, but every 100 turns, the maximum increases by floor(log10(turnNumber))

You cannot spawn an invader if there is already an invader on the first space of the board. Therefore, a potential counterplay from defenders to prevent massive hordes of invaders is to put stunners on the first few spaces.

To ensure that even the most basic invader AIs will eventually overwhelm defenders (assuming they actually spawn invaders), a multiplier on HP will be applied which exponentially increases by 10% every 10,000 rounds. (HP will still be rounded down to the nearest integer)

Implementation

Both the Defender and Invaders will have complete knowledge about the state of the game and will be allowed to maintain state from the beginning of the game. They may not directly modify the game state. Any attempts to do so will be disqualified as will any attempt to obfuscate such an attempt.

AIs must return their desired action in less than 15 milliseconds, averaged over 100 turns. Invalid actions returned by the AI will be ignored.

Rules

• No abusing standard loopholes
• No direct modification of the game state passed to you. It will not be defensively deep-copied.
• Obfuscated submissions will be assumed to be cheating. An example of obfuscation would be using JSFuck to hide modification of game state or other underhandedness.
• Any uncaught exceptions will result in disqualification.
• Implementations must be totally deterministic, i.e. random number generators are only allowed if seeded consistently (either with a constant or with game state) and must use isolated random state which the other AI in play cannot access.
• Submissions shall include an explanation of the AI's strategy.

Scoring

Each Defender will face off against each Invader, excluding pairs with identical authors. The number of turns the defender lasted will be averaged across all opponents and that will be its score.

The Defender with the highest score and the Invader with the lowest score will be the winners.

Tower Defense

Overview

Two submissions will compete against each other to invade the other player's village without being invaded themselves. They will have the ability to place towers, upgrade them, and spawn invaders to attack the enemy village. The game will be simulated deterministically in a turn based fashion, with each player being able to do one action each turn.

The game board is made up of two paths, each 100 spaces long. Each player begins with 500 gold, which is used for building towers and spawning invaders; and 100 life. Your objective is to bring your opponent's life down to 0. If neither player has been defeated after 100000 turns, the winner will be the player with the most life at that point, with ties being broken by who has the most gold at that point. If, somehow, there is still a tie, the match will be considered a tie.

Income

Every 10 turns, players will receive gold. Initially, they receive 10 gold, but this amount increases by 3 every 100 turns.

Each time you successfully get an invader through your opponent's defenses, your income increases by 1 and you receive a portion of your income proportional to how much HP the invader had left.

Each time one of your towers defeats an invader, you receive gold. (More on that below)

Towers

Each space on the path can house one tower. There are 3 types of towers, which have a range and a power. It takes 10 turns for a tower to be ready after it is built. Towers can be upgraded either with a wider range or an increased power, in increments of 1. There is no hard limit to how many times a tower can be upgraded.

Range refers to how many spaces away from the tower that can be reached by the tower's abilities. A range of 0 means that only the space that the tower is on is affected by the tower's attacks.

Power has a different meaning depending on the kind of tower.

Turrets

Each turn, turrets fire at the invader within range that is farthest along the path to your village. They deal damage equal to the tower's power.

Turrets begin with a range of 1 and a power of 1.

Stunners

Stunners fire at the invader within range that is farthest along the path to your village. However, instead of dealing damage, they stun the invader for a number of turns equal to the tower's power. After firing, stunners cannot fire again for their power + 1 turns. Stunners will not fire at invaders that are already stunned.

Stunners begin with a range of 0 and a power of 3

Bombs

When an invader is on the same space as the bomb tower, it triggers and deals damage equal to its power to all invaders within its range. After being triggered, it cannot fire again for another 5 turns.

Bombs begin with a range of 2 and a power of 2

Invaders

You are limited on the maximum stats. You start off unable to boost stats, but every 100 turns, the maximum increases by 5

There can only be one invader on each space of the board and invaders cannot pass through each other. You cannot spawn an invader if there is already an invader on the first space of the board. Therefore, a potential counterplay from defenders to prevent massive hordes of invaders is to put stunners on the first few spaces.

Coding

Both players will have complete knowledge about the state of the game and will be allowed to maintain state from the beginning of the game. They may not directly modify the game state. Any attempts to do so will be disqualified as will any attempt to obfuscate such an attempt.

AIs must return their desired action in less than 10 milliseconds, averaged over 100 turns. Invalid actions returned by the AI will be ignored.

Scoring

All submissions will compete against all other submissions in a round-robin tournament. The bot that wins the most matches is declared the winner. In the event of a tie, the number of turns it took to win will be totaled for all winning matches with the smallest cumulative turn count to victory wins. In the unlikely event of a further tie, the turns to loss will be totaled for all losing matches and the bot with the highest cumulative turn count to loss wins.

Only one submission per user can be scored in the round-robin tournament.

Rules

• No abusing standard loopholes
• No direct modification of the game state passed to you. It will not be defensively deep-copied. Don't obfuscate your code to try to hide state modification.
• Any uncaught exceptions will result in disqualification.
• Implementations must be totally deterministic, i.e. random number generators are only allowed if seeded consistently (either with a constant or with game state) and must use isolated random state which the other AI in play cannot access.
• Submissions shall include an explanation of the AI's strategy.