Skip to main content
Share Your Experience: Take the 2024 Developer Survey
36 votes

Take a ride on the Reading, If you pass Go, collect $200

Retina, 74 bytes FKCIIBAVWMGN_PT_NC_CS_PP_SV_CS_PE_LS_BJCVCORIBCMG S_`(._.) _ 9$* \B 1 The third to last and last lines should contain a single space. Try it ...
Martin Ender's user avatar
25 votes

Take a ride on the Reading, If you pass Go, collect $200

Jelly, 44 bytes “£ċ9NɲT⁴MỵƇñdMỊḞ*µ7Sʂɓ¢Ż}ạ¥ċwÞ’ḃ23ṣ4ịØAz⁶ṙ1G Try it online! Idea If we remove every second column and transpose rows with columns, we get the ...
Dennis's user avatar
  • 210k
20 votes

Scrabble scorer

sed 4.2.2, 81 s/[QZ]/JD/g s/[JX]/KB/g s/K/FE/g s/[FHVWY]/BE/g s/[BCMP]/DE/g s/[DG]/EE/g s/./1/g Output is in unary. Reduces each letter to a combination of ...
Digital Trauma's user avatar
19 votes

Simulate a Game of Quagmire

Ruby 2.7, 695...618 610 bytes ...
Dingus's user avatar
  • 11.2k
19 votes

N-movers: How much of the infinite board can I reach?

JavaScript (Node.js), 144 138 125 74 73 70 bytes f=(x,n=2,c=0)=>x%n?x-!c?f(x,n+1)/(n%4>2?n/=~c&1:n%4)**c:1:f(x/n,n,c+1) Try it online! -4 byte thanks @...
Shieru Asakoto's user avatar
18 votes

Determine winner of Connect 4

Perl, 119 118 117 bytes Includes +4 for -0p Give rotated board padded with spaces on STDIN (gravity pulls stones to the right) ...
Ton Hospel's user avatar
  • 14.9k
18 votes
Accepted

Shortest 2-Player Game of Halma

The shortest game of halma is 49 moves 49 move solution Proof there is no 48-move solution Code used for this solution The code now supports pass Notice that the 47 move solution in the paper is ...
Ton Hospel's user avatar
  • 14.9k
16 votes

Draw an Empty Scrabble Board

MATL, 59 54 52 bytes 4t:g2I5vXdK8(3K23h32h(H14(t!XR+8: 7:Pht3$)'DtdTX.'w) Try it online! Explanation The code follows three main steps: Generate the 8x8 ...
Luis Mendo's user avatar
  • 105k
16 votes

Take a ride on the Reading, If you pass Go, collect $200

05AB1E, 48 47 bytes Thanks to Emigna for saving a byte! •(K·;“…¬È¦z"9äuŸé;TÞîÕs‡ÓÐV9XÒt\<•33B¾9ð×:S11ô» Explanation: First some compression. ...
Adnan's user avatar
  • 44.4k
16 votes
Accepted

Is it a good 2048 board?

Haskell, 21 bytes all$scanr1 max>>=(==) Try it online! Takes a list of columns, with empty spaces as 0.
xnor's user avatar
  • 145k
16 votes

Can I Settle Down?

Python 2, 54 bytes lambda s:sum((s+"BLSW"*3).count(n)/4for n in"BLSWO")>3 Try it online! For each of our resources, we count the number of “freedoms” given ...
lynn's user avatar
  • 68.7k
14 votes

Score a 1 player game of Carcassonne

Charcoal, 306 246 bytes ...
Neil's user avatar
  • 171k
12 votes

Take a ride on the Reading, If you pass Go, collect $200

Python 2, 89 bytes l='%s '*11+'\n' print(l+'%s%20s\n'*9+l)%tuple("FKCIIBAVWMGNPTNCCSPPSVCSPELSBJCVCORIBCMG") Creates the template ...
xnor's user avatar
  • 145k
12 votes

Where can the knight be in N moves?

Wolfram Language (Mathematica), 45 bytes Because the other solution is incorrect (see Martin's comment below), so I decide to post my solution: ...
DELETE_ME's user avatar
  • 17.3k
12 votes

Totally random Catan number distributions

JavaScript (ES6), 162 bytes ...
Arnauld's user avatar
  • 193k
11 votes

Scrabble scorer

Octave, 50 bytes @(t)'       '/3*sum(65:90==t')' Try ...
Sanchises's user avatar
  • 9,496
11 votes

Connect 4: Spot the Fake!

JavaScript (ES6),  202 194 187  183 bytes Takes input as a matrix with \$2\$ for red, \$4\$ for yellow and \$0\$ for empty. Returns a string of 0-indexed moves (or an empty string if there's no ...
Arnauld's user avatar
  • 193k
11 votes

N-movers: How much of the infinite board can I reach?

Clean, 189 185 172 171 bytes ...
Οurous's user avatar
  • 8,117
11 votes

Universal Command Sequence

Pyth, 7 bytes s^S4^5* We could construct a universal sequence of length \$2^{2n(n-1)} ⋅ n^2 ⋅ (2n^2 - 2) < 5^{n^2}\$. Start with the empty sequence; then for ...
Anders Kaseorg's user avatar
10 votes

Printing the Cracker Barrel Game

Ruby -pa, 181 bytes ...
Dingus's user avatar
  • 11.2k
10 votes

Is it a good 2048 board?

05AB1E, 4 bytes €{íQ Try it online! Same as my other two answers. I promise this is my last one until others have answered :)
hyper-neutrino's user avatar
  • 42.4k
10 votes

Scrabble scorer

Haskell, 86 84 bytes f s=length s+sum[n|x<-s,(n,y)<-zip(9:7:[1..])$words"QZ JX DG BCMP FHVWY K",x`elem`y] Try it online! Explanation Most letters give a ...
ბიმო's user avatar
  • 16.8k
10 votes

Scrabble scorer

Beatnik, 733 bytes Since it really had to be done, here it is. It was a really nasty to debug and provided a few challenges. Input must be uppercase letters only. Output is unary (hope that is OK?) ...
MickyT's user avatar
  • 12.2k
10 votes

N-movers: How much of the infinite board can I reach?

Mathematica, 80 bytes d[n_]:=If[#=={},0,1/Det@LatticeReduce@#]&@Select[Tuples[Range[-n,n],2],#.#==n&]; This code is mostly reliant on a mathematical ...
Milo Brandt's user avatar
9 votes

Winnable Solitaire Mancala Boards

Python, 42 41 bytes m=lambda n,i=2:n*[1]and[n%i]+m(n-n%i,i+1)
orlp's user avatar
  • 39.1k
9 votes

Draw an Empty Scrabble Board

JavaScript (ES6), 112 bytes ...
Martin L's user avatar
9 votes

Take a ride on the Reading, If you pass Go, collect $200

PowerShell v2+, 131 123 114 110 99 bytes 'F K C I I B A V W M G N0P T0N C0C S0P P0S V0C S0P E0L S0B J C V C O R I B C M G'-replace0,(" "*19) This is just a ...
AdmBorkBork's user avatar
  • 43.4k
9 votes

Take a ride on the Reading, If you pass Go, collect $200

Javascript ES6 REPL, 105 102 101 bytes Not much interesting happening here. Paste in the console to see the desired results Saved 3 bytes thanks to @Arnauld Saved 1 more byte thanks to @Neil ...
Bassdrop Cumberwubwubwub's user avatar
9 votes

Is it a good 2048 board?

APL (Dyalog), 7 4 bytes Takes 4-by-4 matrix, using 0 for blanks, as argument. ⊢≡⌊⍀ Try it online! ⌊⍀ is the vertical ...
Adám's user avatar
  • 30.3k
9 votes
Accepted

Connect 4: Spot the Fake!

Jelly, 57 bytes ŒṪŒ!µ0ịŒṬ¬a³ZU,Ɗ;ŒD$€Ẏṡ€4Ḅo1%15;Ḋ€ṢṚ$Ƒƙ$Ȧȧœị³$2R¤ṁ$ƑµƇṪṪ€ Takes a matrix where 0 is unfilled, ...
Jonathan Allan's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible