← The roster

Deepseek

DeepSeek: DeepSeek V4.1 Flash

deepseek/deepseek-v4.1-flash

Rating, all tests
n/a
Rating, unseen tests
n/a
Released
Sep 10, 2026
Training cutoff
Not published

Answers over time

The same model id, asked the same test on different dates. A change here with no new version number is a provider changing the model behind its name.

One answer per test so far

Re-runs happen every few weeks and whenever the provider changes the model's listing.

DeepSeek: DeepSeek V4.1 Flash over timeResults coming in0 of the 8 blind judgements this chart needs before it means anything.goodharts.aias of Nov 17, 2026 23:09 UTC, 0 judgements
goodharts.ai/c/ETdOFSM/
PNG Share

Recent answers

TextSealed: spatial reasoning #1There are **8** small cubes. Reason: A small cube must lie on one red face and exactly one blue face. Since the two red faces are opposite, each such cube is on an edge where a red face meets a blue face, but not at a corner. Each red face meets the 4 blue faces along 4 edges, and each edge has 1 middle cube in a \(3\times3\times3\) cut. So: \(2\) red faces \(\times 4\) edges \(= 8\). **Answer: 8** CodeFizzBuzz without % or /```python fizz = 0 buzz = 0 for i in range(1, 101): fizz += 1 buzz += 1 if fizz == 3: fizz = 0 if buzz == 5: buzz = 0 if fizz == 0 and buzz == 0: print("FizzBuzz") elif fizz == 0: print("Fizz") elif buzz == 0: print("Buzz") else: print(i) ``` CodeReverse a linked list in C without recursion```c #include <stddef.h> typedef struct Node { int data; struct Node *next; } Node; Node *reverse_list(Node *head) { Node *prev = NULL; Node *curr = head; Node *next; while (curr != NULL) { next = curr->next; /* save the rest of the list */ curr->next = prev; /* reverse the link */ prev = curr; /* advance prev */ curr = next; /* advance curr */ } return prev; /* prev is the new head */ } ``` Explanation: we walk the list once, keeping three pointers — `prev` (the already-reversed prefix), `curr` (the node being processed), and `next` (the untouched remainder). Each iteration flips `curr->next` to point at `prev`, then shifts both pointers forward. When `curr` becomes `NULL`, `prev` sits on what was the last node, which is now the new head. Time is O(n), extra space is O(1).
A pelican riding a bicycle
TextWhy is the sky blue, in exactly three sentencesSunlight looks white, but it is really made of all the colors mixed together. Tiny bits in the air bounce the blue light around more than the other colors. That bounced blue light reaches your eyes from all over the sky, so the sky looks blue.
A walrus balancing on a unicycle
TextCount the vowels in a made-up word7 e, o, u, a, i, e, o TextA haiku where every word starts with SSoft silver skies sigh September softly sinks, slow Scarlet seeds settle
A ball bouncing inside a spinning hexagon
Just the bicycle, drawn correctly
TextHow many sisters does Alice's brother have?Alice’s brother has **4 sisters**: Alice plus her 3 sisters. TextWhich is larger, 9.11 or 9.9?9.9 is larger because 9.9 equals 9.90, and 9.90 is greater than 9.11. TextHow many r's are in strawberry?3. The letter r appears three times in the word strawberry.
An octopus playing a grand piano

Tell us what broke, or what is missing