Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 15968

This challenge is generally based upon, related to, or simulates a game or some portion of one.

2 votes

Tennis scores meets Code Golf

('+z+')':B):B)):B)+'\n'; while(W=C[i++]){ w=--W; // w - index of winner of current game // l - index of loser of current game // d - winner of current point's game score … 6:3,(e=g[l=1-w])+1)){ g=[0,0]; // Reset the game score. …
MT0's user avatar
  • 3,463
9 votes

Hunt the Wumpus

JavaScript (ECMAScript 6) - 2197 1759 -45% = 967.45 Characters Version 1: JSFIDDLE Version 2: JSFIDDLE Nearly finished golfing this... Includes a GUI with an Icosahedral Map and Mega-Bats for the fu …
MT0's user avatar
  • 3,463
13 votes
Accepted

Determine if a move exists in a Bejeweled/match 3 game

Original Solution: JavaScript - 261 255 228 227 179 153 Characters /(\d)(\1(\d|.{6}|.{9})|(\d|.{6}|.{9})\1|.{7}\1(.|.{9})|(.|.{9})\1.{7}|(.{7,9}|.{17})\1.{8}|.{8}\1(.{7,9}|.{17}))\1/.test(s.replace(/\ …
MT0's user avatar
  • 3,463
3 votes

Implement a Non-Guessing Sudoku Solver

Prolog - 493 Characters :-use_module(library(clpfd)). a(X):-all_distinct(X). b([],[],[]). b([A,B,C|X],[D,E,F|Y],[G,H,I|Z]):-a([A,B,C,D,E,F,G,H,I]),b(X,Y,Z). c([A,B,C,D,E,F,G,H,I|X])-->[[A,B,C,D,E,F,G, …
MT0's user avatar
  • 3,463