jbush001

#include <stdio.h>

static long long int positionsEvaluated = 0;

int inOrder(const int rack[10])
{
	int i;
	int last = 0;
	
	for (i = 0; i < 10; i++)

jbush001

# Rack-O simulation

import random

class GreedyHeuristicPlayer():
	def getScore(self, rack):
		return 1

	def choose(self, rack, newCard):
		bestScore = self.getScore(rack)