localvoid

Keybase proof

I hereby claim:

• I am localvoid on github.
• I am localvoid (https://keybase.io/localvoid) on keybase.
• I have a public key whose fingerprint is 16FC FAC9 87E9 B1B8 E987 F582 BF96 BBDD 3AA1 D750

To claim this, I am signing this object:

localvoid

#include <array>
#include <algorithm>
#include <cinttypes>
#include <memory>
#include <iostream>
#include <iomanip>
#include <utility>
#include <random>
#include <cstring>
#include <cstdio>

localvoid

#include <algorithm>
#include <iostream>
#include <memory>
#include <utility>
#include <cassert>
#include <cinttypes>
#include <cstring>

/*
  BitBoard

localvoid

#include <algorithm>
#include <iostream>
#include <memory>
#include <utility>
#include <cassert>
#include <cinttypes>

/*
  Probabilistic algorithm to determine the End Game in the game Hex.

localvoid

#include <cinttypes>
#include <iostream>
#include <iterator>
#include <utility>

/*
  Find all adjacent vertices in the Hex Board.

    position = position - 1 + difference;

localvoid

/*
  Coursera course: C++ For C Programmers <cplusplus4c-002>

  Homework 2: "Implement Dijkstra's Algorithm"

  Implement a Monte Carlo simulation that calculates the average
  shortest path in a graph. The graph can be generated using a
  pseudo-random number generator to produce edges and their costs. The
  shortest path algorithm will be Dijkstra’s.

localvoid

/* 
 * CSE 351 HW1 (Data Lab )
 * 
 * Boris Kaul <[email protected]>
 * 
 * bits.c - Source file with your solutions to the Lab.
 *          This is the file you will hand in to your instructor.
 *
 * WARNING: Do not include the <stdio.h> header; it confuses the dlc
 * compiler. You can still use printf for debugging without including

localvoid

LETTERS = "abcdefghijklmnopqrstuvwxyz"

def prepare(line, subst):
    result = []
    for word in line.split():
        out = []
        for c in word:
            out.append(subst[c] if c in subst else LETTERS)
        result.append(out)
    return result