About Me

Hello!

It's-a me, Jannis Harder, a Gameplay Programmer from Germany. I am a game and coding enthusiast, working professionally on games since 2016. I am always eager to learn new things and improve myself to make the best looking and feeling games writing clean code.

After working as an independent game creator and self-publisher for a few years I started working for Ubisoft Blue Byte Mainz on the Anno franchise. Find out more about my work below.

Skills

  • Languages: C/C++, C#, Python, Lua, JavaScript, HTML5, CSS, PHP
  • Engines: Unreal Engine 4, Unity Engine
  • Software: Visual Studio, VS Code, Blender, Audacity, Photoshop, Premiere
  • Others: Perforce, Git, MySQL

Projects

Anno 1800 Console Edition
  • Ubisoft Blue Byte Mainz - published
  • PS5 / XBox Series X|S - C++
In Anno 1800 you are able to design huge metropolises, manage an emerging economy and protect your creations from others.
To let your cities flourish, you'll have to learn to take the right measures in any situation.

Anno 1800 offers you plenty of opportunities to prove your skills.
Here you'll be able to build huge cities, plan logistic networks, colonize new fertile continents, undertake expeditions around the globe
and dominate your opponents through diplomacy, trade or warfare.

My Tasks

  • Controller Input
  • Build Modes and Build Tools
  • Naval Combat
  • UI Programming
Website: ubisoft.com/de-de/game/anno/1800/console-edition
Screenshots
Videos
Myràd
  • 2 people
  • 3 years
  • MAJA Studios - published
  • MAJA Engine - JavaScript
Myràd is a single player, point-and-click roleplay game.

It was the first game released by MAJA Studios, a company me and a good colleague of me founded.
Myràd was developed parallel to the MAJA engine which is a browser-based engine, fully functional on PCs, mobile phones and tablets.

It was released in 2019 and currently has around 500 players.

Game Features

  • Compelling Story
  • Resources for Camp Building
  • RPG Battle System
  • Recruits for Battle Ship
  • Crafting / Brewing / Farming
  • Battle Story + Daily Quests
  • World Map + Trading System
  • Chose path of Trader or Pirate
Website: myrad-game.de
Screenshots
Gameplay Videos
Engine Interface
JavaScript Code Example - A* Pathfinding in a triangulated polygon
  1. /**
  2.     * Find shortest path in given polygon
  3.     * with A* algorithm using funnel path portals
  4.     * 
  5.     * @param {float[]} fromPoint -  from 2D point
  6.     * @param {float[]} toPoint - to 2D point
  7.     * @returns {float[float[]]} array of 2D points
  8. */
  9. MajaPolygon.prototype.getShortestPath = function(fromPoint, toPoint){
  10.     if(this.triangulation === null){
  11.         //triangulate if necessary
  12.         this.calculateTriangulation();
  13.     }
  14.     
  15.     //get from/to vertex data and ensure points are in polygon
  16.     var closestStartValues = this.getClosestTriangleVertex(fromPoint);
  17.     var startVertex = closestStartValues[0];
  18.     fromPoint = closestStartValues[1];
  19.  
  20.     var closestEndValues = this.getClosestTriangleVertex(toPoint);
  21.     var endVertex = closestEndValues[0];
  22.     toPoint = closestEndValues[1];
  23.  
  24.     if(startVertex !== false && endVertex !== false){
  25.         if(startVertex == endVertex){
  26.             //from/to lie in same triangle, return direct path
  27.             return [fromPoint, toPoint];
  28.         }
  29.  
  30.         var closedSet = [];
  31.         var openSet = [startVertex];
  32.  
  33.         var cameFrom = {};
  34.  
  35.         //use direct distance as score estimation
  36.         var fScore = {};
  37.         fScore[startVertex] = $g.func.getPointDistance(fromPoint, toPoint);
  38.  
  39.         while(openSet.length > 0){
  40.             var currentNode = false;
  41.             var currentNodeIndex = false;
  42.             var currentNodeValue = false;
  43.  
  44.             //get next node with lowest estimated distance value
  45.             for(var i=0;i<openSet.length;i++){
  46.                 var nodeValue = fScore[openSet[i]];
  47.                 if(
  48.                     currentNodeValue === false ||
  49.                     nodeValue < currentNodeValue
  50.                 ){
  51.                     currentNode = openSet[i];
  52.                     currentNodeIndex = i;
  53.                     currentNodeValue = nodeValue;
  54.                 }
  55.             }
  56.  
  57.             if(currentNode == endVertex){
  58.                 //shortest path determined
  59.                 return cameFrom[currentNode][1];
  60.             }
  61.  
  62.             $g.func.removeFromArray(openSet, currentNodeIndex);
  63.             closedSet.push(currentNode);
  64.  
  65.             for(var i=0;i<this.triangulationConnections.length;i+=2){
  66.                 //find neighbour node to given vertex
  67.                 var neighbourNode = false;
  68.                 if(this.triangulationConnections[i] == currentNode){
  69.                     neighbourNode = this.triangulationConnections[i+1];
  70.  
  71.                 } else if(this.triangulationConnections[i+1] == currentNode){
  72.                     neighbourNode = this.triangulationConnections[i];
  73.                 }
  74.  
  75.                 if(
  76.                     neighbourNode !== false &&
  77.                     closedSet.indexOf(neighbourNode) == -1
  78.                 ){
  79.                     //calculate new funnel portal
  80.                     var fromVertices = [];
  81.                     fromVertices.push(this.triangulation[currentNode*3]);
  82.                     fromVertices.push(this.triangulation[(currentNode*3)+1]);
  83.                     fromVertices.push(this.triangulation[(currentNode*3)+2]);
  84.  
  85.                     //find shared portal vertices with neighbour triangle
  86.                     var sharedVerticePoints = [];
  87.                     var toVerticePoint;
  88.                     for(var j=0;j<3;j++){
  89.                         var neighbourVertice = this.triangulation[neighbourNode*3+j];
  90.  
  91.                         var fromVerticeIndex = fromVertices.indexOf(neighbourVertice);
  92.                         if(fromVerticeIndex == -1){
  93.                             //neighbour vertex is not in portal
  94.                             toVerticePoint = [
  95.                                 this.flatArray[(neighbourVertice*2)],
  96.                                 this.flatArray[(neighbourVertice*2)+1]
  97.                             ];
  98.  
  99.                         } else {
  100.                             //neighbour vertex is part of portal
  101.                             var sharedVertice = $g.func.removeFromArray(
  102.                                 fromVertices, fromVerticeIndex
  103.                             );
  104.                             sharedVerticePoints.push([
  105.                                 this.flatArray[(sharedVertice*2)],
  106.                                 this.flatArray[(sharedVertice*2)+1]
  107.                             ]);
  108.                         }
  109.                     }
  110.                     var leftVertice = fromVertices.shift();
  111.                     var fromVerticePoint = [
  112.                         this.flatArray[(leftVertice*2)],
  113.                         this.flatArray[(leftVertice*2)+1]
  114.                     ];
  115.  
  116.                     var cproduct_1 = $g.func.crossProduct(
  117.                         fromVerticePoint, sharedVerticePoints[0], toVerticePoint
  118.                     );
  119.                     var cproduct_2 = $g.func.crossProduct(
  120.                         fromVerticePoint, sharedVerticePoints[1], toVerticePoint
  121.                     );
  122.  
  123.                     //create portal sorted left/right vertex
  124.                     var newPortal;
  125.                     if(cproduct_1 < cproduct_2){
  126.                         newPortal = [sharedVerticePoints[0], sharedVerticePoints[1]];
  127.  
  128.                     } else {
  129.                         newPortal = [sharedVerticePoints[1], sharedVerticePoints[0]];
  130.                     }
  131.  
  132.                     var atEndVertice = (neighbourNode == endVertex);
  133.  
  134.                     //extend or start funnel path algorithm through given portal
  135.                     var aStarFunnelPath, tentativePath;
  136.                     if(currentNode in cameFrom){
  137.                         aStarFunnelPath = cameFrom[currentNode][0].getCopy();
  138.                         tentativePath = aStarFunnelPath.extend(newPortal, atEndVertice);
  139.  
  140.                     } else {
  141.                         aStarFunnelPath = new $g.func.AStarFunnelPath(
  142.                             fromPoint, toPoint, [newPortal]
  143.                         );
  144.                         tentativePath = aStarFunnelPath.calculate(atEndVertice);
  145.                     }
  146.  
  147.                     //get funnel path from start to neighbour node
  148.                     var tentativeGScore = $g.func.getPathLength(tentativePath);
  149.                     
  150.                     if(openSet.indexOf(neighbourNode) == -1){
  151.                         openSet.push(neighbourNode);
  152.  
  153.                     } else if(tentativeGScore >= fScore[neighbourNode]){
  154.                         continue;
  155.                     }
  156.  
  157.                     //store funnel path length as fScore(=gScore)
  158.                     cameFrom[neighbourNode] = [aStarFunnelPath, tentativePath];
  159.                     fScore[neighbourNode] = tentativeGScore;
  160.                 }
  161.             }
  162.         }
  163.  
  164.     } else {
  165.         $g.log_e(
  166.             "getShortestPath",
  167.             "could not calculate start or end "+startVertex+", "+endVertex
  168.         );
  169.     }
  170.  
  171.     return [];
  172. }
The Hive
  • 1 person
  • 1 week
  • private project - prototype
  • Unreal Engine - C++
The Hive is a prototype I created for Brackeys Game Jam 2021.1. The theme is "Stronger Together".
The game is about controlling a swarm of bees to collect nectar, create honey and ensure the surviving of the hive.

Game Features

  • Find blossoms to collect nectar
  • Dance to show other bees the way to known blossoms
  • Spawn and switch between all bees in your hive
  • Eat honey to keep your bees power up to prevent its death
  • Stay home at night, the colder it gets, the faster the bees power drains
  • Stay away from wildlife or the bee stings and dies
Website: itch.io/the-hive
Screenshots
Gameplay Videos
C++ Code Example - Bee Pawn Tick and NPC action
void ABeePawn::Tick(float DeltaTime)
{
    Super::Tick(DeltaTime);

    bool IsInMenu = (GetWorld()->GetAuthGameMode<ATheHiveGameModeBase>())->IsInMenu;

    if (!IsInMenu)
    {
        //remove bee power based on day state
        if ((GetWorld()->GetGameState<ABeeGameStateBase>())->IsNight)
        {
            RemovePower(tickPowerCostsNight);
        }
        else
        {
            RemovePower(tickPowerCosts);
        }
    }

    if (!IsInMenu && RestrictMovementTime <= 0.f)
    {
        //update rotation
        FRotator NewRotation = GetActorRotation();
        NewRotation.Yaw += CameraInput.X;
        NewRotation.Pitch = FMath::Clamp(
            NewRotation.Pitch + CameraInput.Y, -60.f, 89.9f
        );
        SetActorRotation(NewRotation);
    }

    if (IsAlive)
    {
        if (RestrictMovementTime > 0.f)
        {
            //keep movement restricted
            RestrictMovementTime -= DeltaTime;
            MovementInput = FVector(0.f);
        }
        else
        {
            CurrentBeeStatus = BeeStatus::Normal;

            //check npc actions
            if (NpcControlled)
            {
                if (HasTarget)
                {
                    if (
                        (TargetPosition - GetActorLocation()).SizeSquared() <=
                        TargetMinSqrDist
                    )
                    {
                        //bee arrived at destination, update target
                        HasTarget = false;

                        if (NpcTarget == BeeNpcTarget::Flower)
                        {
                            ++NpcFlowerVisits;
                            NpcTarget = BeeNpcTarget::Nothing;
                        }
                        else if (NpcTarget == BeeNpcTarget::Hive)
                        {
                            NpcTarget = BeeNpcTarget::Nothing;
                        }
                    }
                }
                if (!HasTarget)
                {
                    //update target if bee has none
                    CheckNpcAction();
                }

                if (HasTarget)
                {
                    //move npc bee towards target
                    MovementInput =
                        (TargetPosition - GetActorLocation()).GetClampedToMaxSize(MaxSpeed);
                }
            }
        }
    }
    else {
        MovementInput = FVector(0.f, 0.f, -9.81f);
    }

    if (OurMovementComponent && (OurMovementComponent->UpdatedComponent == RootComponent))
    {
        //update movement components velocity
        float UseAccelerationDelta = (CurrentVelocity.SizeSquared() > MovementInput.SizeSquared()) ?
            DeaccelerationDelta : AccelerationDelta;

        CurrentVelocity = FMath::Lerp<FVector>(
            CurrentVelocity, MovementInput, UseAccelerationDelta * DeltaTime
        );
        OurMovementComponent->CurrentVelocity = CurrentVelocity;

        if (NpcControlled && HasTarget)
        {
            //update npcs bee rotation
            SetActorRotation(CurrentVelocity.Rotation());
        }
    }

    MovementInput = FVector(0.f);
}

void ABeePawn::CheckNpcAction()
{
    ABeeGameStateBase* BeeGameState = GetWorld()->GetGameState<ABeeGameStateBase>();

    if (NpcTarget == BeeNpcTarget::HiveEnter)
    {
        //move into hive
        TargetPosition = BeeGameState->HiveCenterPos +
            FMath::VRand() * FMath::RandRange(0.f, HiveCenterRadius);
        HasTarget = true;

        NpcTarget = BeeNpcTarget::Hive;
    }
    else if (IsInHive && Pollen > 0.f)
    {
        PassPollenToHive();
    }
    else if (IsInHive && Power < 0.8f && BeeGameState->HiveHoney > 0.f)
    {
        ConsumeHiveHoney();
    }
    else if (Pollen < 1.f && IsAtFlower != nullptr && IsAtFlower->PollenLeft > 0.f)
    {
        CollectFlowerPollen();
    }
    else if (Pollen > 0.75f || NpcFlowerVisits >= 3 ||
        BeeGameState->IsNight && !IsInHive
    )
    {
        //return to hive, move to hive entry first
        NpcFlowerVisits = 0;

        TargetPosition = BeeGameState->HiveEnterPos +
            FMath::VRand() * FMath::RandRange(0.f, HiveEnterRadius);
        HasTarget = true;

        NpcTarget = BeeNpcTarget::HiveEnter;
    }
    else if (KnowsAboutFlowers.Num() > 0 && !BeeGameState->IsNight)
    {
        //bee is in idle, check next action
        if (NearbyBeePawns.Num() > 0 && FMath::FRandRange(0.f, 1.f) > 0.8f)
        {
            //show nearby bees way to known flowers
            DoFlowerDance();
        }
        else
        {
            if (IsInHive)
            {
                //fly out of hive
                TargetPosition = BeeGameState->HiveEnterPos +
                    FMath::VRand() * FMath::RandRange(0.f, HiveEnterRadius);
                HasTarget = true;
            }
            else
            {
                //fly to random known flower
                AFlower* MoveToFlower = KnowsAboutFlowers[rand()% KnowsAboutFlowers.Num()];

                FBox ColliderBox = MoveToFlower->BoxCollider->Bounds.GetBox();
                TargetPosition = ColliderBox.GetCenter() +
                    FMath::VRand() * FMath::RandRange(0.f, FlowerRadius);
                HasTarget = true;

                NpcTarget = BeeNpcTarget::Flower;
            }
        }
    }
}
Blueprint Code Example - Fox AI Movement
"Karate Kid"
  • 3 people
  • 4 months
  • private project - in production
  • Unity Engine - C#
"Karate Kid" is the project title of a game for mobile phones I am working on within a team of 3 people - an artist and a game designer.
It is still in production and has, as a hobby project, no soon to come release date.

Game Features

  • Customize your Fighter
  • Learn Attack and Defensive skills
  • Use physical and mental training to increase your power/spirit
  • Fight against bosses to increase your belt level
  • Play against players around the world to increase your ranking
Screenshots
Gameplay Videos
C# Code Example - Handle Fighter Animations
  1. public IEnumerator StartGymAnimation(PlayerTimer activeTimer){
  2.     System.Type timerType = (activeTimer != null) ?
  3.         activeTimer.GetType() : null;
  4.  
  5.     //prepare animations
  6.     if(timerType != null){
  7.         if(timerType == typeof(PlayerTimerTrainingSkill)){
  8.             if(CheckPlayerFighterStatus(
  9.                 FighterState.IDLE, GameController.staticStateNames["to_idle"].stateName
  10.             )){
  11.                 yield return new WaitForSeconds(1f);
  12.             }
  13.  
  14.             BattleFighter.UpdateFighterState(FighterState.TRAINING);
  15.  
  16.             TrainingSkill trainingSkill =
  17.                 ((PlayerTimerTrainingSkill)activeTimer).GetTrainingSkill();
  18.             string prepareStateName =
  19.                 trainingSkill.GetPrepareAnimationStateName();
  20.             if(prepareStateName != ""){
  21.                 BattleFighter.FadeToAnimationState(prepareStateName, 0.15f);
  22.                 yield return new WaitForSeconds(1f);
  23.             }
  24.  
  25.         } else {
  26.             if(CheckPlayerFighterStatus(
  27.                 FighterState.STANCE,
  28.                 GameController.staticStateNames["to_stance"].stateName
  29.             )){
  30.                 yield return new WaitForSeconds(1f);
  31.             }
  32.         }
  33.  
  34.     } else {
  35.         if(CheckPlayerFighterStatus(
  36.             FighterState.IDLE,
  37.             GameController.staticStateNames["to_idle"].stateName
  38.         )){
  39.             yield return new WaitForSeconds(1f);
  40.         }
  41.     }
  42.  
  43.     //start animations
  44.     if(timerType != null){
  45.         if(timerType == typeof(PlayerTimerDefenseSkill)){
  46.             DefenseSkill defenseSkill =
  47.                 ((PlayerTimerDefenseSkill)activeTimer).GetDefenseSkill();
  48.             if(defenseSkill != activePartnerTrainingDefenseSkill){
  49.                 activePartnerTrainingDefenseSkill = defenseSkill;
  50.  
  51.                 List<KeyValuePair<SkillAnimationState, Attack>> defenseSkillAttacks =
  52.                     new List<KeyValuePair<SkillAnimationState, Attack>>();
  53.                 foreach(
  54.                     SkillAnimationState skillAnimationState in
  55.                     defenseSkill.skillAnimationStates
  56.                 ){
  57.                     foreach(Attack attack in GameModel.attacks){
  58.                         if(
  59.                             attack.GetAttackCategory() ==
  60.                             defenseSkill.GetAnswerToAttackCategory() &&
  61.                             attack.GetAttackPosition() ==
  62.                             skillAnimationState.GetRestrictedToAttackPosition()
  63.                         ){
  64.                             defenseSkillAttacks.Add(
  65.                                 new KeyValuePair<SkillAnimationState, Attack>(
  66.                                     skillAnimationState, attack
  67.                                 )
  68.                             );
  69.                         }
  70.                     }
  71.                 }
  72.  
  73.                 partnerTrainingCoroutine = Game.StartSync(
  74.                     ShowPartnerTraining(defenseSkill, defenseSkillAttacks)
  75.                 );
  76.             }
  77.  
  78.         } else {
  79.             activePartnerTrainingDefenseSkill = null;
  80.  
  81.             List<AnimationScript> gymAnimationScripts =
  82.                 activeTimer.GetGymAnimationScripts();
  83.             if(gymAnimationScripts.Count > 0){
  84.                 BattleFighter.StartAnimationScript(
  85.                     gymAnimationScripts[UnityEngine.Random.Range(
  86.                         0, gymAnimationScripts.Count
  87.                     )].GetIdentifier(), true
  88.                 );
  89.  
  90.             } else {
  91.                 float minRepeatTime = 1.2f;
  92.                 float maxRepeatTime = 1.8f;
  93.  
  94.                 List<SkillAnimationState> animationStateNames =
  95.                     activeTimer.GetSkillAnimationStates(true, true);
  96.                 BattleFighter.RepeatTrainingAnimationState(
  97.                     GameController.staticStateNames["stance"], animationStateNames,
  98.                     minRepeatTime, maxRepeatTime
  99.                 );
  100.             }
  101.         }
  102.  
  103.     } else {
  104.         activePartnerTrainingDefenseSkill = null;
  105.  
  106.         List<SkillAnimationState> randomIdleAnimationStates =
  107.             new List<SkillAnimationState>(){
  108.                 GameController.staticStateNames["random_idle_1"],
  109.                 GameController.staticStateNames["random_idle_2"],
  110.                 GameController.staticStateNames["random_idle_3"]
  111.         };
  112.         BattleFighter.RepeatTrainingAnimationState(
  113.             GameController.staticStateNames["idle"], randomIdleAnimationStates,
  114.             5f, 8f
  115.         );
  116.     }
  117. }
"Water League"
  • 1 person
  • 1 week
  • private project - prototype
  • Unity Engine - C#
Water League is a proof-of-concept prototype which is based on the popular game "Rocket League".
It has the same mechanics, with only half of the arena being underwater.

Game Features

  • Use Boost to dive underwater and fly through the air
  • Use the cars body to move the ball
  • Shoot inside your enemies' goal to score
Screenshots
Gameplay Videos
C# Code Example - Process Car Input
  1. public void ProcessInput(){
  2.     float driftInput = Input.GetAxis("Drift");
  3.     float accelerateInput = Input.GetAxis("Accelerate");
  4.     float verticalInput = Input.GetAxis("Vertical");
  5.     float horizontalInput = Input.GetAxis("Horizontal");
  6.     float boostInput = Input.GetAxis("Boost");
  7.     float rollInput = Input.GetAxis("Roll");
  8.  
  9.     float driftStiffness = (driftInput != 0) ? 0.5f : 2f;
  10.  
  11.     WheelHit wheelHit;
  12.     bool groundContact = backLeftCollider.GetGroundHit(out wheelHit);
  13.     
  14.     //edit wheel colliders
  15.     WheelFrictionCurve frontLectFriction = frontLeftCollider.sidewaysFriction;
  16.     frontLeftCollider.sidewaysFriction = frontLectFriction;
  17.  
  18.     WheelFrictionCurve frontRightFriction = frontRightCollider.sidewaysFriction;
  19.     frontRightCollider.sidewaysFriction = frontRightFriction;
  20.     
  21.     WheelFrictionCurve backLectFriction = backLeftCollider.sidewaysFriction;
  22.     backLectFriction.stiffness = driftStiffness;
  23.     backLeftCollider.sidewaysFriction = backLectFriction;
  24.  
  25.     WheelFrictionCurve backRightFriction = backRightCollider.sidewaysFriction;
  26.     backRightFriction.stiffness = driftStiffness;
  27.     backRightCollider.sidewaysFriction = backRightFriction;
  28.  
  29.     float motorTorque = (groundContact) ? (motorForce*accelerateInput) : 0f;
  30.     float steeringAngle = (maxSteerAngle*horizontalInput);
  31.  
  32.     backLeftCollider.motorTorque = motorTorque;
  33.     backRightCollider.motorTorque = motorTorque;
  34.  
  35.     frontLeftCollider.steerAngle = steeringAngle;
  36.     frontRightCollider.steerAngle = steeringAngle;
  37.  
  38.     waterElementController.SetFixedGravity((constantGravity || groundContact));
  39.  
  40.     //apply torque
  41.     if(!groundContact){
  42.         carRigidbody.AddTorque(
  43.             transform.right*verticalInput*frontTorqueSpeed, ForceMode.Acceleration
  44.         );
  45.  
  46.         if(rollInput != 0){
  47.             carRigidbody.AddTorque(
  48.                 -transform.forward*horizontalInput*torqueSpeed, ForceMode.Acceleration
  49.             );
  50.  
  51.         } else {
  52.             carRigidbody.AddTorque(
  53.                 transform.up*horizontalInput*sideTorqueSpeed, ForceMode.Acceleration
  54.             );
  55.         }
  56.     }
  57.  
  58.     //apply jump forces
  59.     if(inputJump){
  60.         if(groundContact){
  61.             timeForDoubleJump = (Time.time+2f);
  62.  
  63.             AddJumpForce(transform.up);
  64.  
  65.         } else if(Time.time <= timeForDoubleJump){
  66.             timeForDoubleJump = 0;
  67.  
  68.             carRigidbody.drag = 0f;
  69.             carRigidbody.angularDrag = 0f;
  70.             waterElementController.SetUnfixedGravity(true);
  71.  
  72.             Vector3 jumpDirection = transform.forward*verticalInput +
  73.                 transform.right*horizontalInput + transform.up*0.001f;
  74.             AddJumpForce(jumpDirection);
  75.  
  76.             if(
  77.                 Mathf.Abs(verticalInput) > Mathf.Epsilon ||
  78.                 Mathf.Abs(horizontalInput) > Mathf.Epsilon
  79.             ){
  80.                 Vector3 torqueDirection = transform.right*verticalInput -
  81.                     transform.forward*horizontalInput;
  82.                 carRigidbody.AddTorque(
  83.                     torqueDirection*doubleJumpForce, ForceMode.Impulse
  84.                 );
  85.             }
  86.  
  87.             StartCoroutine(ResetJumpGravity());
  88.         }
  89.     }
  90.     
  91.     //apply boost
  92.     ApplyBoost(boostInput);
  93.     
  94.     UpdateEngineAudio(verticalInput, boostInput);
  95. }
"Tree Cutter"
  • 1 person
  • 3 weeks
  • private project - prototype
  • Unity Engine - C#
"Tree Cutter" is a proof-of-concept project, originally intended to be released on Christmas for mobile phones.
It is about a lumberjack who cuts trees and carries them home to his town, to sell them to villagers.

Game Features
  • Chop Trees based on your villagers needs
  • Carry and present the trees in your sales area
  • Sell your trees: the bigger the more expensive
  • Use your money to buy food
  • Drink of nearby rivers or lakes: The hungrier and thirstier, the slower you are
Screenshots
Gameplay Videos
C# Code Example - Pulled Tree Forces and Rope Constraints
  1. protected virtual void Update(){
  2.     if(carryingTreeController != null){
  3.         //calculate trees distance
  4.         Vector3 treeDiff = transform.position -
  5.             carryingTreeController.trunkRope.transform.position;
  6.         float treeDistance = treeDiff.magnitude;
  7.  
  8.         if(treeDistance > 6f){
  9.             //apply force to pull tree near to person
  10.             carryingTreeController.transform.position +=
  11.                 treeDiff.normalized * (treeDistance-6f);
  12.             if(carryingTreeController.body != null){
  13.                 carryingTreeController.body.AddForceAtPosition(
  14.                     treeDiff, carryingTreeController.trunkRope.transform.position,
  15.                     ForceMode.Acceleration
  16.                 );
  17.             }
  18.  
  19.             if(Random.value < 0.1f){
  20.                 carryingTreeController.PlayPullSound();
  21.             }
  22.         }
  23.  
  24.         //update rope constraint positions
  25.         rope.startPoint = rightHandTransform.position;
  26.         rope.endPoint = carryingTreeController.trunkRope.transform.position;
  27.         rope.minYPos = Mathf.Min(
  28.             transform.position.y, carryingTreeController.trunkRope.transform.position.y
  29.         );
  30.     }
  31. }
  32.  
  33. public void SetCarryTree(TreeController treeController){
  34.     if(treeController != null && carryingTreeController == null){
  35.         //set tree to carry
  36.         if(treeController.body == null){
  37.             StartCoroutine(treeController.AddRigidbody());
  38.         }
  39.         carryingTreeController = treeController;
  40.         
  41.         //add rope and set constraint positions
  42.         rope = Instantiate(ropePrefab).GetComponent<Rope>();
  43.         rope.transform.SetParent(transform, false);
  44.         
  45.         rope.startPoint = rightHandTransform.position;
  46.         rope.endPoint = carryingTreeController.trunkRope.transform.position;
  47.         rope.minYPos = Mathf.Min(
  48.             transform.position.y, carryingTreeController.trunkRope.transform.position.y
  49.         );
  50.  
  51.         carryingTreeController.trunkRope.SetActive(true);
  52.  
  53.         animator.SetBool("pull_tree", true);
  54.  
  55.     } else {
  56.         //unset carrying tree, remove rope
  57.         Destroy(rope.gameObject);
  58.  
  59.         carryingTreeController.trunkRope.SetActive(false);
  60.  
  61.         carryingTreeController = null;
  62.         rope = null;
  63.  
  64.         animator.SetBool("pull_tree", false);
  65.     }
  66. }
Animator Example - Person Movement and Right Hand Overwriting

CV

Ubisoft Blue Byte GmbH, Mainz

Gameplay Programmer July 2022 - now
Junior Gameplay Programmer May 2021 - June 2022
In early 2021 I applied to a role in Ubisoft Mainz and started working on the Anno franchise in may. My first project was the Anno 1800 Console Edition which was released in March 2023.

MAJA Studios UG, Berlin

Founder/Programmer Oct 2016 - Feb 2021
MAJA Studios is the company I founded together with a close friend of mine. We began working on a browser-based engine in 2016 and in parallel worked on our first game Myràd.

The engine is browser-based, capable of server-client multiplayer networking using server-based JavaScript including the nodejs and socket.IO libraries. It uses the HTML5 Canvas element to render high resolution images and runs smoothly on all modern devices.

My roles in MAJA Studios included everything relevant for the studio including:
  • Writing and Testing the MAJA Engine
  • Setting up game servers running Linux CentOS 7
  • Creating the Story/Game Design/UI for Myràd
  • Being responsible for taxes and running the business
  • Providing support for the players through the engines support system and an external forum
After our first game Myràd, we decided to work on a second project and contact publishers that could help us with marketing. Due to personal reasons, we stopped this process in 2021 and decided to move our own ways.

Thüringer Energie AG, Erfurt

Junior IT Developer Jan 2015 - Oct 2016
After writing my bachelor thesis in this company, I was mainly responsible for the development of a web-based solution for photovoltaic monitoring.

I was also part of a team to plan and develop other in-house software solutions and was also responsible for the administration of multiple third-party software.

After I finished the photovoltaic monitoring project, I decided to move on to find further challenges in the games industry.

Bauhaus-Universität Weimar

Bachelor of Science Sep 2010 - Apr 2014
I got my bachelor’s degree in Weimar studying Computer Science and Media. My bachelor thesis was about visualizing time-based log data of photovoltaic systems which lead me to my first job.

The education included:
  • Mathematics: Calculus, Linear Algebra, Stochastics, Numerics, Discrete Mathematics
  • Programming: Formal languages and complexity, Algorightms & Data Structures, Introduction to Software Engineering, Programming Languages + Software Engineering, Information and Coding Theory, Parallel and distributed Systems, HCI, Media Security + Kryptology, Introduction to Computer Science, Databases, Web based technologies
  • Graphics: Visualization, Computer Graphics, Usability: Perceptual and Cognitive Foundations, Photogrammetric Computer Vision, Web Basics I
  • Audio: Audio Processing, Computer sounds - basics and practice
  • Others: Introduction to Media Economics, Media Law, Antagonists for visuospatial games, The Road to TRECT: A Competition on Web Search, Electrical engineering and systems theory, Three-dimensional web-interfaces - new approaches in visualization, interaction and animation
I also anticipated in the Games Master Class, a workshop hosted by the Fraunhofer Institute in Erfurt, which included talks and hosted projects with leading game developers from German game studios.

Contact Me

LinkedIn
jannisharder@hotmail.de
Jannis Harder - Gameplay Programmer