This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# 8-bit Mac Terminal Colors | |
print("\033c\033[3J") | |
ENDC = "\033[0m" | |
PINK = "\033[94m" | |
MAGENTA = "\033[35m" | |
CYAN = "\033[36m" | |
LIGHT_CYAN = "\033[96m" | |
GREEN = "\033[92m" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import random | |
import math | |
import copy | |
class Layer: | |
def __init__(self, inputSize, outputSize, init_random = False): | |
self.inputSize = inputSize | |
self.outputSize = outputSize |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# ~ Trees ~ | |
# This Gist focuses on the Tree datastructure, | |
# generation of random trees by encoded distribution, | |
# verbose printing and visual display of tree, | |
# and the ability to check the deepest-rightmost node. | |