Basic Leaf 03/05/201903/05/2019 | J & J Coding AdventureJ & J Coding Adventure | 0 Comment | 10:46 pm Categories: Difficulty Level 8 recursion Use recursion to draw the following basic leaf shape. Related Project: Curvy Leaf Tags: recursion Post navigation PREVIOUS Previous post: Rotating Rainbow SpiralNEXT Next post: Curvy Leaf Related Post Sierpinski Triangle Tree with Python and Turtle (Source Code)Sierpinski Triangle Tree with Python and Turtle (Source Code) 08/19/202008/19/2020 | J & J Coding AdventureJ & J Coding Adventure | 0 Comment Use recursion to draw the following Sierpinski Triangle the similar method to drawing a fractal tree. Source Code: READ MOREREAD MORE Colored Five Pointed Star FractalColored Five Pointed Star Fractal 10/06/202110/06/2021 | JinshengJinsheng | 0 Comment Fill the five pointed stars with random colors with random colors. Refer to this project that draw uncolored five pointed star fractal. READ MOREREAD MORE AI Tic-Tac-Toe with Minimax Tree (Source Code Included)AI Tic-Tac-Toe with Minimax Tree (Source Code Included) 07/03/202007/03/2020 | J & J Coding AdventureJ & J Coding Adventure | 0 Comment Use minimax tree search algorithm with alpha-beta pruning to write AI Tic-Tac-Toe player. You may also want to add randomness to your AI player so that it won’t play the READ MOREREAD MORE
Sierpinski Triangle Tree with Python and Turtle (Source Code)Sierpinski Triangle Tree with Python and Turtle (Source Code) 08/19/202008/19/2020 | J & J Coding AdventureJ & J Coding Adventure | 0 Comment Use recursion to draw the following Sierpinski Triangle the similar method to drawing a fractal tree. Source Code: READ MOREREAD MORE
Colored Five Pointed Star FractalColored Five Pointed Star Fractal 10/06/202110/06/2021 | JinshengJinsheng | 0 Comment Fill the five pointed stars with random colors with random colors. Refer to this project that draw uncolored five pointed star fractal. READ MOREREAD MORE
AI Tic-Tac-Toe with Minimax Tree (Source Code Included)AI Tic-Tac-Toe with Minimax Tree (Source Code Included) 07/03/202007/03/2020 | J & J Coding AdventureJ & J Coding Adventure | 0 Comment Use minimax tree search algorithm with alpha-beta pruning to write AI Tic-Tac-Toe player. You may also want to add randomness to your AI player so that it won’t play the READ MOREREAD MORE