6
Given the following data:
constraints = {{11, 2}, {11, 3}, {11, 4}, {11, 6}, {11, 9}, {1, 6}, {5, 6}, {2, 5}};
weights = {3, 7, 3, 2, 4, 2, 2, 2, 3, 2, 1};
I wish to partition the integers from 1 to 11 into subsets such that:
each integer from 1 to 11 appears exactly once
the sum of weights...
Possible resistances from resistors
code-golf electrical-engineering
Meta: Note this is far from done; just putting this idea out so that I can continue working on it. IE way work in progress. I need to specify a lot more of this and I'm putting this here because I know I won't end up working o...
An input with many outputs
Consider two binary strings A and B of length 2x-1 and x, respectively. Now consider a binary output array Z of length x where Z[i] is 1 if B = A[i,...,i+x-1] and 0 otherwise.
For a given fixed B, there are a number of different possible output arrays Z. You can find...
A regular expression homework on StackOverflow
(Source: http://stackoverflow.com/questions/27988149/find-regular-expressions-of-a-language)
code-golf
Write 10 regular expressions for the 10 tasks below, each with a different regex flavor. No code execution is allowed in the regex.
One of the ...
Equivalent move sequences on the Rubik's Cube
code-golf puzzle-solver
A move sequence is a sequence of moves (turns) on a Rubik's Cube (for the notation loow below). For each move sequence, you can find infinite other move sequences, that cause the same results as the original one. In other wor...
