Radioactive Train

This game was developed as part of a university assignment for Programming for Videogames I.

The main goal: create a C++ game where a train carrying radioactive material must reach the end of the track with as many wagons as possible.

🕹️ Gameplay

The train starts with a locomotive and two wagons, each numbered randomly from 0 to 9.

As it moves, it encounters new wagons.

To add a new wagon, the player must correctly solve a random addition problem (three numbers between 0 and 9).

If the answer is correct and given within 5 seconds, the new wagon is added to the train, sorted by its value.

If the answer is wrong or too slow, an existing wagon is destroyed.

The train moves from the top-left of the screen, scrolling to the right and looping to the next lane below.

⏱️ Win / Lose conditions

✅ Win: keep the train running and collect as many wagons as possible.

❌ Lose: lose all three key elements (two wagons + locomotive).

📦 Linked List Implementation

The train is simulated using a linked list:

Wagons can be inserted in order based on their number.

Wagons can be removed dynamically if the player fails.

This demonstrates adding, ordering, and removing elements in real time.

🎮 Controls

Keyboard: enter the result of the sum problem when prompted.

The train moves automatically.

⚙️ Technologies used

C++

SFML

Visual Studio

👨‍💻 Developer: 

JulioCZ - Technical Degree in Videogame Design and Programming