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 ...
- 196k
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 ...
- 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 ...
- 71.8k
19
votes
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 @...
- 6,178
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 ...
- 14.8k
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)
...
- 14.8k
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 ...
- 104k
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. ...
- 44.3k
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.
- 144k
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 ...
- 68.1k
14
votes
13
votes
Number of pieces on a checkers board
Hexagony, 19 bytes
?({{&2'2':{):!/)'*/
Try it online.
Explanation
This is still the same computation as I've used in my CJam and Labyrinth answers, but due ...
- 196k
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
...
- 144k
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:
...
- 17.2k
12
votes
11
votes
11
votes
Accepted
Connect-n time!
MaxGayne
This bot assigns a score to each position, based mainly on the length of connected parts. It looks 3 moves deep inspecting 3 best looking moves at each stage, and chooses the one with the ...
- 2,912
11
votes
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 ...
- 188k
11
votes
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 ...
- 39.4k
10
votes
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 :)
- 41.3k
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 ...
- 16.7k
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?)
...
- 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 ...
- 271
9
votes
9
votes
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 ...
- 43.3k
Only top scored, non community-wiki answers of a minimum length are eligible