Björn Lindqvist
• Member for 8 years
• Last seen more than a month ago

Here is my entry to get this challenge off the ground. Python code: print "pass" According to your rules always playing "pass" is a valid (albeit bad) strategy.

Factor - 488 bytes: USING: arrays ascii kernel math math.parser math.ranges pcre sequences ; IN: examples.golf.homework : c ( a -- b ) >lower "(?:[,:]|^) *(\\d+) *(?:- *(\\d+) *(e|o)?)?&...

Python: 1266 characters (measured using wc) from collections import *;import re A,B,y,c=namedtuple('A',['l','r']),namedtuple('B',['i','b']),type,list.pop def ab(t):c(t,0);p=c(t,0);c(t,0);return B(p,...

Factor has a built-in type for rotatable arrays, <circular>, so this is actually a O(1) operation: : rotate ( circ n -- ) neg swap change-circular-start ; IN: 1 9 [a,b] <circular> ...

My solution written in Factor: USING: formatting fry grouping kernel math math.combinatorics math.ranges pcre sequences sets ; IN: xkcd1313 : name-set ( str -- set ) "\\s"...

Factor - Bytes: 1342, False +ves: X, False -ves: 0 = Score: X USING: ascii base64 bit-arrays bloom-filters io kernel sequences system ; IN: examples.golf.wordcheck CONSTANT: S "...