# Marshall Lochbaum

A quiet enigma. We don't know anything about Marshall Lochbaum yet.

## Posts

BQN, 17 bytesSBCS {𝕩∾1𝕊⍟≠⌊𝕩⋆2|𝕩+÷2} Run online! BQN primitives alone can't express unbounded iteration, so this must be a recursive block function. {𝕩∾1𝕊⍟≠⌊𝕩⋆2|𝕩+÷2} # Function 𝕊 taking argu...

posted 2y ago by Marshall Lochbaum

BQN, 18 bytesSBCS 'A'-¬⊸⌊2×13-˜⌜○↕14 Run online! This solution computes a table of c-r, where r is the row number and c is the column number, so that the first row is 0 1 2… and the first colu...

posted 2y ago by Marshall Lochbaum

BQN, 24 bytesSBCS {g⊔⁼𝕊¨⍟(1<≠)𝕩⊔˜∧g←2|↕≠𝕩} Run online! {g⊔⁼𝕊¨⍟(1<≠)𝕩⊔˜∧g←2|↕≠𝕩} { } # Block function 𝕊 with argument 𝕩 ≠𝕩 # Length of 𝕩 ...

posted 2y ago by Marshall Lochbaum

BQN, 19 bytesSBCS ' '+32⊸<⊸×+⌜˜⌽⊸⌊↕59 Run online! This uses the whitespace allowance, padding by four spaces on all sides to make the arithmetic work better. It can be adjusted by replacing...

posted 2y ago by Marshall Lochbaum

BQN, 14 solutions (SBCS) Run online! This link shows the result of each expression and a table of character intersections. Each expression intersects with itself only, giving a diagonal matrix. Th...

posted 2y ago by Marshall Lochbaum · edited 2y ago by Marshall Lochbaum

BQN, 7 6 bytesSBCS ≢↑∘⊢´↕ Run online! The less-golfed version {↑⍟𝕩⟨⟩} is more readable: it applies Prefixes (↑) the given number of times to the empty list ⟨⟩ and… that's it. (Suffixes also wo...

posted 2y ago by Marshall Lochbaum · edited 2y ago by Marshall Lochbaum

BQN, 20 bytesSBCS ∾2/0‿8⊏↓"∾2/0‿8⊏↓""" Run online! BQN's strings escape double quotes by doubling them, so that the string used to start with only contains a single quote, although the output ...

posted 2y ago by Marshall Lochbaum

BQN, 18 bytesSBCS {⊑(⊑𝕨⊸⍷)¨⊸/∾⟜𝕩¨↑𝕨} Run online! A direct translation of Razetime's APL solution (my attempted improvement ⊣∾{⊢´/𝕨⊸«⊸≡¨↑𝕩}↓⊢ turns out to be not at all correct). The BQN solut...

posted 2y ago by Marshall Lochbaum

BQN, 25 bytesSBCS ⌊⊸≡(/0=↕⊸|){(+´÷≠)∘𝔽¨«⟜𝔽} Run online! This expression has a complicated structure. This link uses BQN's explain feature to show the order in which everything is applied. It's...

posted 2y ago by Marshall Lochbaum · edited 2y ago by Marshall Lochbaum

BQN, 8 bytesSBCS ⍒↕+2|⊢+↕ Run online! The solution itself is an 8-train, so its evaluation order is given by the sequence 7 5 6 3 4 1 2 0: first the rightmost ↕, then the ⊢, then the + between...

posted 2y ago by Marshall Lochbaum

BQN, 21 bytesSBCS (¬·×-+´·/0=↕⊸|)¨⊸⊔1+↕ Run online! Mostly one big train used to find the appropriate group for each number, to be used with Group (⊔). The combining functions in a train norma...

posted 2y ago by Marshall Lochbaum

Seems to be an issue with the ordering (across languages) when "Group by language" is set. When I first load the page, they are ordered with the most recent post first. If I then uncheck "Group by ...

posted 2y ago by Marshall Lochbaum · edited 2y ago by Marshall Lochbaum

BQN, 32 bytesSBCS Run online! {∨´∾8(⥊(⊐⌾⥊𝕩)⍷·≠⌜˜2|/∘⥊)¨1+↕≠⥊𝕩} Brute force: tests against all boards up to the number of characters in 𝕩 using Find (⍷). Using the longest dimension is faster b...

posted 12mo ago by Marshall Lochbaum · edited 12mo ago by Marshall Lochbaum

BQN, 15 bytesSBCS {𝕨(1+⊢𝕊-)⟜𝕩⍟>0} Run online! A block function that takes $t_1$ as the left argument 𝕨 and $t_2$ as the right argument 𝕩. In BQN, 𝕊 indicates recursion on the current block ...

posted 2y ago by Marshall Lochbaum

BQN, 8 bytesSBCS ∾⊒˜¨⊔○∾⊢ Run online! and parsing diagram The idea here is to build a list of groups, with group i containing the ith character of each string that has one, then join the group...

posted 2y ago by Marshall Lochbaum

Reputation | 681 | |

Number of top-level posts | 0 | |

Number of answers | 20 | |

Sum of received votes (up minus down) | 68 | |

Number of edits made | 9 |

## Earned Abilities

## Statistics

Posts | ||
---|---|---|

Count | 20 | |

Questions | 0 | |

Answers | 20 | |

Articles | 0 |

Votes cast | ||
---|---|---|

Count | 8 |

Flags raised | ||
---|---|---|

Count | 0 |