In my last article, I created an enemy that will chase the player. Now it is time to allow the player to defend themselves by giving them a weapon. Table of Contents Projectile Prefab Object Pooling Shooting Mechanics Projectile Behavior Rotate Player Projectile Prefab The first thing we are going to do is create a…

I have implemented player movement in the project I am working on using Unity’s new input system. Now it is time to create an enemy for the player to interact with. Right-click in the hierarchy and go down to 2D Object -> Sprites -> Circle.

I have started working on a new project and decided it was time to dive into the new input system Unity has. In this post, I will show how to install the input system in a unity project and set up a basic player movement. To get started, navigate to…

Floyd’s cycle-finding algorithm is famous for detecting if a linked list contains a cycle. This algorithm is also referred to as the Hare-Tortoise algorithm because of the use of a slow and fast pointer. How it Works The algorithm starts with two pointers set to the head of a linked…

I have been learning to create multiplayer games. I have been using the Unity engine to create the game and Mirror to handle multiplayer aspects.

I have been working on learning how to implement multiplayer for unity projects using Mirror. To use Mirror, you can click the link above and add it to your unity assets. Now go into your unity project and import Mirror using the package manager.

To input and output information to the console in C++, you will use the standard input-output stream (iostream) library. Output To output information, you will use the code std::cout. This code is referencing the standard output stream. In most cases, the output device is the display screen. Here is an example with the classic Hello World! program.

There are many ways to traverse a binary tree. The two most common ways to traverse a binary tree are depth-first search and breadth-first search. Depth-First Search Depth-first search works by starting at the root node and traversing as far as possible along the branches of the tree. Once the…

A binary heap is a type of binary tree that has its own set of rules. There are two types of binary heaps which are the max-heap and the min-heap. Rules The first rule the binary max-heap follows is that each node’s value must be greater than the value of…