bciccarelli

from itertools import permutations, groupby
width = 0
def solution(times, time_limit):
	global width
	width = len(times)
	numBunnies = width - 2
	full = [i for i in range(width)]
	fullBunnies = full[:-2]
	fullBunniesIndex = [i+1 for i in fullBunnies]
	if(negativeCycles(times)):

bciccarelli

import math
def solution(map):
	searchMap = []
	searchMap.append((0,0,0))
	moves = 0
	finished = False
	while not finished:
		[searchMap, finished] = search(searchMap, map)
		moves += 1
	return moves