View multiprocessing.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
View race_condition.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
View threading.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
View d3_sine_wave.html
<!DOCTYPE html> | |
<html> | |
<head> | |
<!-- ################### --> | |
<!-- STYLE --> | |
<!-- ################### --> | |
<style> | |
body { | |
margin: 0; | |
} |
View game_of_life.py
import numpy as np | |
from scipy.ndimage import convolve | |
import matplotlib.pyplot as plt | |
import matplotlib | |
import copy | |
# Setup | |
BOARD_WIDTH = 10 | |
BOARD_HEIGHT = 10 | |
BOARD = np.zeros((BOARD_HEIGHT, BOARD_WIDTH)) |
View recurse_tac_toe.py
# IDEAS FOR COMPUTERIZED OPPONENT: | |
# [] Add prompt for 1 Player or 2 Player at start of game | |
# [] Based on number of players, override player selection with random computer selection | |
# [] Once random selection is working, add more intelligent computer selection (some ideas): | |
# * If computer could win game, it should win game | |
# * If computer can put board in state where next move it could win game, it should do that move | |
# * If computer can put board in state where next move it could win game REGARDLESS of human selection, do that move | |
# * Apply deep learning on millions of games of tic tac toe to become the ultimate RecurseTacToe algorithm (just kidding :D) |