As a little kid, I liked to play with these toys a lot:
They probably intended for these to be used for art, but I always used them for math! Fractals, patterns, etc. One time, I was given this challenge:
Build a triangle without using any of the green triangle tiles.
This challenge stum...
The goal: write a program that implements a turing-complete system. It could be cellular automata, a tag system, a turing machine, an interpreter for a language of your own design... the type of system doesn't matter as long as it satisfies the following conditions:
Takes a "program" from the u...
Defs need to fix up layout
[Very much a WIP]
Maze battle
In this challenge, bots will team up, navigate around a maze and try to destroy the enemy team's artifact, and protect their own.
A maze might look like this. Note that the bots will receive numbers rather than ascii art, which represen...
...will you help me immortalize it?
I've had this pillow a few years now, and apparently it's time to get rid of it. Can you please write a function or program, that I can bring with me and use to recreate this pillow whenever I want to reminisce a bit.
Since I'll bring this with me, I'd pref...
A Primenary (binary-prime) string is one which, when written as a binary grid, every row and column has a prime total.
That's quite a vague explanation, so let's break it down with a worked example...
For this example we'll use the string bunny:
First, find the ASCII code point of each ...
Inspired by, and in memory of, my dear friend and colleague,
Dan Baronet, 1956 – 2016.
He found the shortest possible APL solution to this task:
Task
Given a Boolean list, count the number of trailing truth values.
Example cases
{} → 0
{0} → 0
{1} → 1
{0, 1, 1, 0, 0} → 0
{1, 1, 1, 0, ...
How are variables and memory managed in Python? Does it have a stack and a heap and what algorithm is used to manage memory? Given this knowledge are there any recommendations on memory management for large number/data crunching?
Python, 66 65 bytes
f=lambda x,s=1:s<len(x)and(x==2*x[:s])+f(x[:s])*f(x[s:])+f(x,s+1)
Returns 0 for unpairable strings and anything greater than 0 for pairable strings.
Try it online!
Any help golfing this would be appreciated.
Balanced Lists
To check whether a given list (eg. [5, 1, -2, 7]) is balanced one can imagine putting respective weights on a board (########) and then try to balance the board on an edge (^) such that left and right of the edge the summed weight is the same (ignoring everything physics may has t...
