Skip to content

Instantly share code, notes, and snippets.

View drvinceknight's full-sized avatar
😀
👍

Vince Knight drvinceknight

😀
👍
View GitHub Profile

Paper accepted: "An Open Framework for the Reproducible Study of the Iterated Prisoner’s Dilemma "

Vince Knight

On the 31st of August, myself and 21 co-authors had an article accepted for publication in the journal of open research software. This list of authors includes mathematicians and software developers from various parts of the world as well as some of our own students.

Having 22 authors is not common in Mathematics but with the other core developers of the software in question, we decided that anyone who made a

Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
nbs = $(wildcard *.ipynb)
pdfs = $(nbs:%.ipynb=%.pdf)
all: $(pdfs)
%.pdf: %.ipynb
jupyter-nbconvert --to pdf $<;
import csv # The csv module
with open('tmp.csv', 'w') as f: # Opening a file in write mode
csvwriter = csv.writer(f)
csvwriter.writerow(['Header'])
with open('tmp.csv', 'a') as f: # Opening a file in append mode
csvwriter = csv.writer(f)
for k in range(100): # Looping over first 99 integers
csvwriter.writerow([k])
\documentclass{article}
\begin{document}
\begin{center}
\begin{tabular}{cccccccccc}
\input{CC_table.tex}
\end{tabular}
\end{center}
\end{document}
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
\documentclass{article}
\usepackage{tikz}
\begin{document}
\framebox{
\begin{tikzpicture}
\draw [thick] (0,0) to [bend left=50] (0,10);
\draw [thick] (3,0) to [bend left=70] (3,10);
\draw [thick] (5,2) to [bend left=90] (5,8);
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
import collections
import random
def dice_roll():
return random.randint(1, 6)
def index_of_same(rolls):
counter = collections.Counter(rolls)
rolls.sort(key= lambda x:(counter[x], x))
nbr_the_same = max(counter.values())