Projects & Writeups

Overview

DESTORY is an indie RPG inspired by Deltarune, Earthbound and others. The story takes place in the Sotta Kingdom, a strange world where a prophecy is whispered among shadows. Meet funny and intriguing characters, explore a mysterious world, and uncover the secrets of [REDACTED]. The rules of this world are different: you don't have to fight, but you can if you want to. DESTORY focuses on storytelling, character development, and player choice, allowing for multiple endings based on your decisions. Chapter 1 is available, and Chapter 2 is currently in development.

I started this project in October 2018 with a simple goal: having multiple endings depending on player's choices. I had been playing RPGs for years and would sometimes get frustrated that my choices didn't have a real impact on the story, or be disappointed in the endings. Thus why I wanted to create a game where the player's decisions would truly matter and lead to different outcomes.

Check it out!

Stack

GameMaker, DirectX, JSON

Challenges

Choosing a suitable game engine was not easy as I had tried multiple engines before settling on GameMaker. The learning curve was steep, and I had to adapt to the engine's limitations and quirks. Learning how to draw pixel art and compose music was also a challenge, as I had no prior experience in these areas. And as of now it is hard to draw characters and animations that I am satisfied with, but I keep improving over time.

Learnings

With this project, I learned about game design principles, storytelling in games, and the importance of iteration and feedback in development. I also learned how to compose music and create pixel art, which added a personal touch to the game. It has been a passion project that I have worked on in my free time, and it has taught me a lot about project management.

Overview

Neptune/OS is an operating system project designed to learn about fundamentals, including bootloaders, memory management, and hardware interactions.

See GitHub Repository

Stack

C, Assembly (x86), Make, Bochs/QEMU

Key Features

• Custom 2-stage bootloader
• Protected mode kernel
• Basic task scheduler
• Dynamic memory management & Paging
• Interrupt handling
• VGA text mode driver
• Keyboard input handling

Challenges

Understanding protected mode, implementing GDT and IDT, debugging low-level code without traditional debugging tools, implementing paging, dynamic memory allocation (heap) and task switching.

Learnings

Deep understanding of x86 architecture, hardware-software interfaces, importance of precise documentation reading, patience in low-level debugging.

See GitHub Repository

Stack

Java, OpenGL, LWJGL, Shader Language (GLSL)

Key Features

• 3D rendering
• Very basic collisions
• Shader support
• Lighting system
• Model loading
• Water rendering
• Procedural terrain generation

Challenges

Implementing shaders, especially for water rendering. Debugging rendering issues, managing model loading and performance optimization.

Learnings

Understanding OpenGL rendering pipeline, shader programming, and matrix transformations in a 3D context.

Overview

I created this project for fun and to learn more about OpenGL and graphics optimization.

See GitHub Repository

Stack

Java, OpenGL, LWJGL

Key Features

• Terrain generation
• Block placing and texture rendering
• Primitive lighting system
• AABB collision and gravity
• Chunk updates
• Level saving and loading

Challenges

Optimizing rendering performance, managing memory usage for large terrain chunks, and implementing efficient chunk loading/unloading.

Overview

I wrote this paper for the AC20 (research) class as I wanted to learn more about quantum algorithms and their domain of applications. First of all, Mathematical concepts are introduced to understand the quantum world, such as complex numbers, multilinear algebra and probability theory. Then, classical computation models are presented to highlight the differences with quantum computation and understand the motivation behind it. The formalism used to describe whether a given problem is difficult or not is also introduced, with some complexity theory. Afterwards, the paper explores the principles of quantum mechanics that are relevant to computation, including superposition, entanglement, and quantum gates. Finally, it delves into simple quantum algorithms, such as Deutsch's algorithm and Deutsch-Jozsa's algorithm, to illustrate both the potential advantages and disadvantages of quantum computation over classical approaches ; experiments on quantum machines are also carried out at the end in order to have concrete comparisons. The latter is only available in French for now, but I might translate it to English in the future if there is interest.

Download PDF

Learnings

Understanding quantum algorithms, quantum gates, and how quantum computers differ from classical computers.