robpe

def neighbours(grid, pos)
  x, y = pos
  [[x-1, y], [x+1, y], [x, y-1], [x, y+1]].select do |i, j|
    i > 0 && i < grid.first.size && j > 0 && j < grid.size && grid[j][i] == 0
  end
end

def jump_neighbours(grid, pos)
  x, y = pos
  width, height = grid.first.size, grid.size

robpe

package main

import (
    "log"
    "net/http"
    "net/http/httputil"
)

func main() {
    http.HandleFunc("/", func(w http.ResponseWriter, r *http.Request) {

robpe

/* https://github.com/fay-jai/coderbyte */

function ArrayAdditionI(arr) {
  var arr = arr.sort(function(a, b) { return a-b; })
      max = arr.pop(),
      sums = [];
  (function smash(sum, arr) {
    if(arr.length == 0 || sum > max ) return;
    sums.push(sum)
    for(var i in arr) {

robpe

function ipslice(arr, l) {
  var arr = arr.slice()
  arr.splice(l, 1)
  return arr
}

var permutations = function(arr) {
  if(!arr.length) return [arr]
  var perm = []
  for(var i in arr) {

robpe

module Kernel

  require 'singleton'
  require 'continuation'

  class Env < Hash
    include Singleton

    def initialize
      super

robpe

function sum(a) {
   return (a[0] != undefined)+0 && a[0] + sum(a.slice(1, a.length))
}