Challenges

Featured Challenge:
#154 — Tic Tac Toe AI with Minimax Algorithm

In this challenge I take the Tic Tac Toe game from coding challenge #149 and add an AI opponent for a human player by implenenting the Minimax algorithm.

dec 11, 2019

Tic Tac Toe AI with Minimax Algorithm

Filter by Language

Pick a language to filter

Filter by Topic

tree

Visualizing the Barnsley Fern fractal with Processing (Java)!

Barnsley Fern

This multi-part coding challenge is part of the first week of my course: "Intelligence and Learning." Here I attempt to implement a classic data structure: The Binary Search Tree.

Binary Tree

In this coding challenge, I'm building on top of the Space Colonization video and creating a 3D Fractal Tree, using the same algorithm, in Processing.

3D Fractal Trees

In this third installment of my series on algorithmic botany, I discuss L-systems and how they can be used to generate trees and other fractal patterns in p5.js.

Fractal Trees - L-System

In this coding challenge, I'm using the space colonization algorithm to make a tree generator. This is the 4th part of my algorithmic botany series.

Space Colonization

In this coding challenge, I'll implement fractal trees with recursion in p5.js. This is the first part of a series on algorithmic botany.

Recursive Fractal Trees

More algorithmic botany! Another way to generate a fractal tree is to consider every part of the tree an object, so that we can apply forces and attributes to all the branches and leaves and more!

Object-Oriented Fractal Trees