jamiees2

# Enter your code here. Read input from STDIN. Print output to STDOUT
class Node:
    def __init__(self,value,point):
        self.value = value
        self.point = point
        self.parent = None
        self.H = 0
        self.G = 0
    def move_cost(self,other):
        return 0 if self.value == '.' else 1

jamiees2

const fs = require("fs/promises");
const fsWatch = require("fs").watch;
const fsExistsSync = require("fs").existsSync;
const assert = require("assert");

class FileTailer {
    constructor(filepath, logger = console) {
        this.filepath = filepath;
        this.watcher = null;
        this.watching = false;

jamiees2

% \documentclass[9pt,a4paper,twocolumn,landscape,oneside]{amsart}
\documentclass[9pt,a4paper,landscape,oneside]{amsart}
\usepackage{amsmath, amsthm, amssymb, amsfonts}
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage{booktabs}
\usepackage{fancyhdr}
\usepackage{float}
\usepackage{fullpage}
%\usepackage{geometry}

jamiees2

#!/usr/bin/python

# Head ends here
from collections import deque
class Node:
    def __init__(self, point,parent=None):
        self.point = point
        self.parent = parent

explored = []

jamiees2

for (let i = 0; i < 10; i++) {
    console.log(i);
}

console.log('360 no-scope', i);	

jamiees2

Keybase proof

I hereby claim:

• I am jamiees2 on github.
• I am jameselias (https://keybase.io/jameselias) on keybase.
• I have a public key whose fingerprint is 0AD4 D571 6EC5 EF63 AA44 1BCF 540F 3E19 921A 77E4

To claim this, I am signing this object:

jamiees2

#!/usr/bin/python

# Head ends here
import heapq
class Node:
    def __init__(self, point,parent=None):
        self.point = point
        self.parent = parent

def nextMove( x, y, pacman_x, pacman_y, food_x, food_y, grid):

jamiees2

# Enter your code here. Read input from STDIN. Print output to STDOUT
import re
def read_corpus():
    corpus = {}
    with open('corpus.txt') as c:
        for line in c:
            words = re.findall(r"[a-z]+",line.strip().lower())
            for word in words:
                if word is '':
                    continue

jamiees2

# Enter your code here. Read input from STDIN. Print output to STDOUT
class Node:
    def __init__(self,state,action):
        self.state = state
        self.action = action
        self.parent = None
        self.H = 0
        self.G = 0
    def move_cost(self,other):
        return 1

jamiees2

# Enter your code here. Read input from STDIN. Print output to STDOUT

def read_words():
    with open('words.txt') as f:
        return [line.strip().lower() for line in f]
def strip_chars(word):
    word = word.lower().strip()
    if word.startswith('#'):
        return word[1:]
    if word.startswith('www'):