×
Modal Header
Modal Body
Heya peeps, Ofek Gila here!
Games (Most with AIs)
Perhaps my strongest AI, my Connect Four Monte Carlo tree search AI is very powerful and very fast!
An AI I literally whipped over two nights—the interface is slightly lacking—but plays well nonetheless.
The good old retro game of Old Snakey, coded with multiple AIs (that you can simultaneously play against!)
My first Monte Carlo tree search AI! The game itself is programmed with a customizable set of rules.
This game predates this website by half a year, and was made in a few hours. It seems to be the largest attraction of my site for some reason.
Tools and other Math Stuff
A depth-first search maze generator with a generation animation option and maze styles!
A super-fast prime number factorizer that uses a sieve of a size that you get to input!
A function grapher with a neat tracing and newtons' method (click 'n' in trace mode).
A Happy Number calculator.
Reverse the last two characters of words :P
Generate random passwords quickly!
About Me
Hello world!!!I'm currently a college student at the University of California, Irvine where I am double majoring in Computer Science and Physics. As you might be able to tell from my website and my blog, I focus more on the logistical side of programming and less on the aesthetic side. That doesn't mean I can't work with html and css—I can and I have—but I find it much less enjoyable, and it takes me more than it should to figure things out. On the other hand—I'm in love with the world of—
Sadly, my knowledge in algorithms is still very limited, but it's expanding. Most of my knowledge in the field has been entirely self-taught. While still in my Introductions to Java course in high school, I built a fully functioning Old Snakey game with a few AIs—teaching me the basics of Breadth-first search, a maze generator and solver that taught me Depth-first search, and much, much more that helped me refine those skills. I later moved into some basic Game Theory, and have a few online games now with rather strong computer opponents.
When I was fifteen, I decided to tackle—the relatively new Monte Carlo tree search. If you were familiar with this AI algorithm, you would be able to guess that I learned about this from an obsession with the game of Go. After joining my school's Go Club (and becoming the president sophomore year), my love for Go has only been increasing. This made it hard to avoid hearing the words "Monte Carlo tree search" although I never knew what they really meant other than that they referred to some random AI algorithm (note the punny use of the word 'random'). After I started getting into Game Theory, I decided to finally teach myself this Monte Carlo tree search. With no formal guide or lesson plan, it took me two whole days to finally create a basic working Monte Carlo tree search AI for the game Mancala. I refined and greatly improved this algorithm for my strong Connect Four AI. (Side note: after I already wrote AIs for a few games using MCTS, Google released AlphaGo, so you bet I was following it every step of the way). While on vacation, seeing my older brother play Ultimate Tic Tac Toe, I whipped up an AI overnight, and greatly improved it on the second night.
Now that I'm in college, I have a lot less free time to work on my website, double majoring and trying to build a strong network of friends. I spend a lot of energy also researching in some particle collider physics (go team ATLAS!), and I'm currently working as a C++ summer intern for a super awesome company called Synopsys! I'm enjoying the present as long as I can!
2022 update: Now I'm done with my Bachelor's double majoring in Computer Science and in Physics. I finished both with honors. I worked at Cloudera for 3 internships (I built AMPs!) and at Snowflake last summer. During COVID, I worked on researching my heritage, and recently made a website about my family, the Gila family. Feel free to learn more about my family at gila.family!