Code

I’m always trying to learn or do something new, even when it’s useless. Take a look at some of my personal projects in which I’ve worked on:

RbTSCP

Ruby implementation of Tom Kerrigan’s Simple Chess Program (TSCP), for sure not the best implementation that it can have, since this implementation was made just to work and be improved later. It’s ELO is about 1370, it means that it can win from newbies and some average players.

ZombieRB

Implementation of the ZOMBIE-ORIENTED MACHINE BEING INTERFACE ENGINE (Zombie). You know, like Hex, but with evil beings! Written in Ruby to offset the evil a bit. Evil necromancers might want to go here to read the specification.

gulp-less2sass

This was my first NPM package and Gulp plugin released, it was made to learn how to do both. It takes Less code and transpiles to Sass. Will not work with all Less codes, but it was not the purpose.

Interest Guesser POC and Interest Guesser

Interest Guesser learn the user’s interests and then guesses about. It was made to learn some new things like Node.JS, Machine Learning, Natural Language Processing. The POC was a success, then I keep the idea and tried to learn some things more: Spring, Redis, Hadoop, Cassandra, Kafka, Yeoman and REST APIs. Unfortunately, I’ve not finished the Java version, but I’ve learned much of what was purposed.

Befunge-93 Interpreter

This is a Ruby implementation of Befunge’s interpreter. It means that you can run befunge code inside your ruby application and get it’s output during runtime. “Befunge is a two-dimensional fungeoidal (in fact, the original fungeoid) esoteric programming language invented in 1993 by Chris Pressey with the goal of being as difficult to compile as possible.” - Esolangs

RPG Maker Game.exe in Ruby

Ruby implementation of RPG Maker’s Game.exe. Implementations in C and C++ were kind confuse before it. Main objetive with this implementation was to show initialization cycle in a more readable way.

Ruby Brainf**k

Brainf**k language implementation in Ruby.

Big Factorial

Calculate large number’s factorial using Stirling’s Approximation. For a given number N, will return the significant digits and the exponent for scientific notation of N!.