idea: infinite chess but the players also have infinite pieces
(possibly include omega ordinals so that players can command pieces infinitely far away from the board origin)
(include only 8 ranks)
things to decide on: how the pieces continue along, whether it's just regular chess pieces and such etc.
what if the pieces were aperiodic? like, off the side of the board, there's a rook, then 1 bishop, then another rook, then 2 bishops, then another rook, 3 bishops, etc.
possibly more complicated
i think it will be interesting, since the main value of the rooks will be their development, since there are an infinite amount of them
possibly could include infinite types of pieces based on their distance from the board origin
challenge idea: check if two fairy pieces in Betza's funny notation are equivalent e.g. WW and R are equal, as are FW and WF. but W and F are not, for example
@DestructibleLemon There could be infinitely many rook/knight/bishop-type pieces, where rooks move by multiples of vector (1,0), knights (1,2) and bishops (1,1) and generally by (a,b), where gcd(a,b)==1.
Title: Count the days
Inspired by a real-life scenario, which I have asked for an answer to here: https://superuser.com/questions/1312212/writing-a-formula-to-count-how-many-times-each-date-appears-in-a-set-of-date-ran
Given an array of timespans (or startdate-enddate pairs), output a count of ...
Given an integer N perform the following steps: (using 9 as an example).
Receive input N. (9)
Convert N from base10 to base2. (1001)
Increase every bit by 1. (2112)
Treat the result as base3 and convert it back to base10. (68)
Return/Output the result.
Input
May be received in any reasonab...
@user202729 Ah, now I understand. (They are called "idioms" in Dyalog lingo) I wouldn't worry about it for development purposes, except if performance is critical from the outset. I suspect that they were chosen so that natural J style would end up using them. At least that's the case in Dyalog APL.
Dollar Bill Auction
king-of-the-hill game
I was going to make a KOTH for the prisoner's dilemma, but this would make for actual variety.
This is a KOTH challenge for the dollar bill auction game in game theory. In it, a dollar is being sold to the highest bidder. Bids go up in increments of ...
@user202729 At least APL is in good company. Also, that GoL is definitely not APL2, and it is a very strange version which I can't even get to work. Current record (for Dyalog APL) is 0≤⊢-3 4⍳⊢∘≢∘⍸⌺3 3.
The Stolen Necklace problem code-golf
Inspired by this video.
Overview:
The Borsuk-Ulam Theorem guarantees that, for every continuous function from an n-sphere into Euclidean n-space, there's a pair of antipodal points of the sphere that maps to the same point.
"Formally: if f : Sn→Rn is con...
@user202729 It's supposed to swap between the previously used memories (current and last used), but it's been quite buggy to implement, and is sort of covered by the subscripts, so I might remove it
___ encrypting
Given two text a and b, both contain only lowercase letters
Write each charactor in a into 5 digits of binary (a => 00001, z => 11010)
Write each charactor in b where such place of the binary list is 1 is written into a different style (uppercase, bold, etc., but should be consi...
So, the cyclic levenquine challenge is almost a year old now. I was wondering if it is even possible and have attempted a start on a proof of impossibility. Does anyone want to join me?
unfortunately, I don't think that would fit as an answer, since the question asks about solutions to the challenge, but about a proof that it's impossible
@StephenLeppik You won't be able to prove the Cyclic Levenquine impossible, because it is possible. It would be fairly easy for me to design a language with a cyclic levenquine. The difficulty of the challenge is that you don't get to design your own language.
The toy language could be aa -> ab, ab -> bb, bb -> ba, ba -> aa. And aa would be a cyclic levenquine.
@EriktheOutgolfer Yes, that's why no one has done it. I'm just saying that you can't prove it impossible
Our requirements are explanation based not behavior based, thus we can make the explanation as complex as we want to justify whatever behavior we wish.
I was thinking of a proof of impossibility for a long-running unanswered question on this site. By a proof of impossibility, what I mean is a proof that no possible answer can solve the challenge. When I polled chat for other interested fellows, one response was this:
unfortunately, I don't t...
Poll: I think I've found a way to make submissions to this sandboxed question infeasible to crack with modern computing power, but it is a little involved and I don't think anyone else is aware of it. Should I still post the challenge?
Recreational languages win at code golf too much. This challenge is simple, when using higher level functions.
The task is as follows:
Given any url (for example https://en.wikipedia.org/wiki/Ruby_on_Rails, which has 9 images), count the number of images displayed from the resultant webpage.
...
Interleaving Sequences
code-golfsequence
Your challenge is to create a function/program that takes an arbitrary number of sequences and outputs all possible interleavings of those sequences.
Examples
Input: [1, 2], [3, 4]
Output:
[1, 2, 3, 4]
[1, 3, 2, 4]
[1, 3, 4, 2]
[3, 1...
Given a list of two or more spelled-out serial numbers of equal length greater than two, e.g.
[[ "three" , "one" , "four" ],
[ "one" , "five" , "nine" ],
[ "two" , "six" , "five" ],
[ "three" , "five" , "eight" ]]
sort the list by the numbers that the words represent:
[[ "one" ,...
In the context of quines, an intron is a part of a quine that serves no purpose in producing output, but is still included in the data section. For example:
function quine() {
const data = "function quine() {\n const data=\"@\";\n // Arr! This be an intron!\n return data.replace(\...
@Pavel 'abrlo39b<7'; is a NOP - it's a string literal that isn't assigned to anything. $? returns the exit code of the last system call executed within Perl (0 if there haven't been any).
Title: Count the days
Inspired by a real-life scenario, which I have asked for an answer to here: https://superuser.com/questions/1312212/writing-a-formula-to-count-how-many-times-each-date-appears-in-a-set-of-date-ran
Given an array of timespans (or startdate-enddate pairs), output a count of ...
Given an integer N perform the following steps: (using 9 as an example).
Receive input N. (9)
Convert N from base10 to base2. (1001)
Increase every bit by 1. (2112)
Treat the result as base3 and convert it back to base10. (68)
Return/Output the result.
Input
May be received in any reasonab...
Dollar Bill Auction
king-of-the-hill game
I was going to make a KOTH for the prisoner's dilemma, but this would make for actual variety.
This is a KOTH challenge for the dollar bill auction game in game theory. In it, a dollar is being sold to the highest bidder. Bids go up in increments of ...
The Stolen Necklace problem code-golf
Inspired by this video.
Overview:
The Borsuk-Ulam Theorem guarantees that, for every continuous function from an n-sphere into Euclidean n-space, there's a pair of antipodal points of the sphere that maps to the same point.
"Formally: if f : Sn→Rn is con...
___ encrypting
Given two text a and b, both contain only lowercase letters
Write each charactor in a into 5 digits of binary (a => 00001, z => 11010)
Write each charactor in b where such place of the binary list is 1 is written into a different style (uppercase, bold, etc., but should be consi...
I was thinking of a proof of impossibility for a long-running unanswered question on this site. By a proof of impossibility, what I mean is a proof that no possible answer can solve the challenge. When I polled chat for other interested fellows, one response was this:
unfortunately, I don't t...
Recreational languages win at code golf too much. This challenge is simple, when using higher level functions.
The task is as follows:
Given any url (for example https://en.wikipedia.org/wiki/Ruby_on_Rails, which has 9 images), count the number of images displayed from the resultant webpage.
...
Interleaving Sequences
code-golfsequence
Your challenge is to create a function/program that takes an arbitrary number of sequences and outputs all possible interleavings of those sequences.
Examples
Input: [1, 2], [3, 4]
Output:
[1, 2, 3, 4]
[1, 3, 2, 4]
[1, 3, 4, 2]
[3, 1...
Given a list of two or more spelled-out serial numbers of equal length greater than two, e.g.
[[ "three" , "one" , "four" ],
[ "one" , "five" , "nine" ],
[ "two" , "six" , "five" ],
[ "three" , "five" , "eight" ]]
sort the list by the numbers that the words represent:
[[ "one" ,...
