Activity for trichoplax
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Article | — |
Balanced quinary quasiquine [FINALIZED] Now posted: Balanced quinary quasiquine Give an integer $N$ in balanced quinary, output the first $N$ characters of your source code if $N$ is positive, or the last $-N$ characters of your source code if $N$ is negative. Terminology Quinary Standard quinary (base $5$) has digits $0, 1, ... (more) |
— | over 1 year ago |
| Article | — |
Cod golf: choose your own shoal This is a fixed output challenge. It is similar to a standard Kolmogorov complexity challenge, except you get to choose your own fixed output. Given no input, output 255 fishes. You may choose any 255 distinct fishes from the following list: ```text african glass catfish african lungfish aholeh... (more) |
— | over 1 year ago |
| Question | — |
Knight safe squares Given a chess board with some knights on it, say how many squares are neither attacked by a knight nor containing a knight. Input - An 8 by 8 grid where each square is either a knight or empty - The input can contain any number of knights from 0 to 64 - You may choose to take input with any 2 d... (more) |
— | over 1 year ago |
| Question | — |
The holeyest base Given a positive integer as input, indicate which base from 2 to 16 gives the most holes in the representation of the input in that base. The digits used are 0123456789ABCDEF. Note that these include upper case letters (the number of holes would be different for lower case letters). Different f... (more) |
— | over 1 year ago |
| Answer | — |
A: What would this community like to see in a Codidact API? I'd like to post king-of-the-hill contests that read code directly from answers Essentials This is the only feature I would need in order to start posting contests. - The answer content for each answer to a specified post This allows extracting the code block that constitutes a king-of-the-... (more) |
— | over 1 year ago |
| Question | — |
What would this community like to see in a Codidact API? I've now posted on Codidact Meta How should a Codidact public API work? I'll still be taking into account any discussion here if you have Code Golf specific thoughts, but for general API discussion please answer/comment there to get responses from all the communities. I posted previously on... (more) |
— | over 1 year ago |
| Question | — |
8 coexisting queens This is a fixed output challenge. Output a textual representation of a chessboard hosting 8 queens, none of which are attacking each other. There are 92 ways of arranging them, 12 if rotations and reflections are discounted. You may choose any 1 of these arrangements. You are not required to ca... (more) |
— | over 1 year ago |
| Article | — |
Knight safe squares [FINALIZED] Now posted: Knight safe squares Given a chess board with some knights on it, say how many squares are neither attacked by a knight nor containing a knight. Input - An 8 by 8 grid where each square is either a knight or empty - You may choose to take input with any 2 distinct characters re... (more) |
— | over 1 year ago |
| Article | — |
Holeyest base representation [FINALIZED] Now posted: The holeyest base Given a positive integer as input, indicate which base from 2 to 16 gives the most holes in the representation of the input in that base. The digits used are 0123456789ABCDEF. Note that these include upper case letters (the number of holes would be different fo... (more) |
— | over 1 year ago |
| Article | — |
8 coexisting queens [FINALIZED] Now posted: 8 coexisting queens This is a fixed output challenge. Output a textual representation of a chessboard hosting 8 queens, none of which are attacking each other. There are 92 ways of arranging them, 12 if rotations and reflections are discounted. You may choose any 1 of these arra... (more) |
— | over 1 year ago |
| Question | — |
55 fruit salad: choose your own Kolmogorov complexity This is a fixed output challenge. It is similar to a standard Kolmogorov complexity challenge, except you get to choose your own fixed output. Given no input, output 55 fruits. You may choose any 55 distinct fruits from the following list: ```text abiu açaí acerola achacha ackee afghan cherr... (more) |
— | over 1 year ago |
| Question | — |
Rationalise recurring binary Given a potentially recurring binary string, output the number it represents, as a fraction in lowest terms. The notation used in this challenge for recurring digits is non-standard. An `r` is used to indicate that the remaining digits recur. For example, `0.000r10` means the last 2 digits recur, ... (more) |
— | over 1 year ago |
| Question | — |
Is there a problem with the edit queues? I'm raising this on our local Meta first, rather than the main Codidact Meta, because I don't yet have the Edit Posts ability so I can't tell what problems may exist. Hopefully some of you who have this ability will be able to confirm whether there are any bugs / feature requests that should be raise... (more) |
— | over 1 year ago |
| Article | — |
3D compass point from 3D coordinates Given 3 dimensional (3D) Cartesian coordinates (x, y, z), output the 3D compass point that comes nearest to describing the direction from the origin. Definitions Directions In reality, the direction of North changes as you move across the surface of the globe. This challenge is based in a simpli... (more) |
— | over 1 year ago |
| Article | — |
55 fruit salad: choose your own Kolmogorov complexity [FINALIZED] Now posted: 55 fruit salad: choose your own Kolmogorov complexity This is a fixed output challenge. It is similar to a standard Kolmogorov complexity challenge, except you get to choose your own fixed output. Given no input, output 55 fruits. You may choose any 55 distinct fruits from the foll... (more) |
— | over 1 year ago |
| Question | — |
Chequer checker A chequer board (also spelt "checker board" in some places) is an 8 by 8 grid of squares alternating between 2 colours. Check whether a provided pattern could be a region of a chequer board. The colours in the pattern will be represented by letters of the alphabet. The squares of a chequer boar... (more) |
— | over 1 year ago |
| Article | — |
Rationalise recurring binary [FINALIZED] Now posted: Rationalise recurring binary Given a potentially recurring binary string, output the number it represents, as a fraction in lowest terms. The notation used in this challenge for recurring digits is non-standard. An `r` is used to indicate that the remaining digits recur. For exa... (more) |
— | over 1 year ago |
| Question | — |
Presumptuous base conversion Take an input string representing a number and convert it to decimal (base 10). However, the base of the input is not specified. Assume the input is in the smallest base for which its digits are valid. Input - The input consists only of characters from 0123456789ABCDEF where A to F represent the ... (more) |
— | over 1 year ago |
| Answer | — |
A: Filtering the sandbox for ease of feedback Both tags and [FINALIZED] are problematic Problem with tags Having been shown the related meta post [Separate the tags away from the Sandbox or delete the \[finalized\] tag] I can now see that having tags in the Sandbox that are not tags for Challenges is problematic. It's clear from that post that... (more) |
— | over 1 year ago |
| Answer | — |
A: Filtering the sandbox for ease of feedback I'm leaving this answer here for any votes and discussion, but I no longer hold this opinion. I've posted a [longer answer] to explain why I've changed my mind After hearing about the filter developments currently being worked on, mentioned in [Monica's comment], my personal opinion is that ta... (more) |
— | over 1 year ago |
| Question | — |
Filtering the sandbox for ease of feedback I see the Sandbox as a vital part of challenge design. When I visit the Sandbox I'd like to be able to show only proposals that are not finalized, so I can focus feedback where it is needed. In the absence of dedicated functionality, I can search for [sandbox posts without the "finalized" tag]. ... (more) |
— | over 1 year ago |
| Article | — |
Presumptuous base conversion [FINALIZED] Now posted: Presumptuous base conversion Take an input string representing a number and convert it to decimal (base 10). However, the base of the input is not specified. Assume the input is in the smallest base for which its digits are valid. Input - The input consists only of characters f... (more) |
— | over 1 year ago |
| Article | — |
Chequer checker [FINALIZED] Now posted: Chequer checker A chequer board (also spelt "checker board" in some places) is an 8 by 8 grid of squares alternating between 2 colours. Check whether a provided pattern could be a region of a chequer board. The colours in the pattern will be represented by letters of the alphabe... (more) |
— | over 1 year ago |
- ← Previous
- 1
- 2
- Next →