# Reports:Tasks not implemented in Nim

**Awareness**

If

**Nim**is a language you like, or are interested in, please inform your fellow members of the Nim community; this page can't be emptied without your and their participation.

## Contents

## Not implemented[edit]

These are currently not implemented in Nim. Please implement some if you can. If any tasks are not possible or too complex in Nim, they should not be on this list. To mark a task as such, add **{{omit from|Nim}}**, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.

### A

- AKS test for primes
- AVL tree
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- Abelian sandpile model
- Abundant odd numbers
- Active Directory/Connect
- Active Directory/Search for a user
- Active object
- Add a variable to a class instance at runtime
- Aliquot sequence classifications
- Anagrams/Deranged anagrams
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Animation
- Append a record to the end of a text file
- Apply a digital filter (direct form II transposed)
- Approximate Equality
- Archimedean spiral
- Arena storage pool
- Arithmetic-geometric mean/Calculate Pi
- Atomic updates

### B

- Balanced ternary
- Base64 decode data
- Benford's law
- Bernoulli numbers
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/PPM conversion through a pipe
- Bitmap/Read an image through a pipe
- Brace expansion
- Brownian tree
- Bulls and cows/Player

### C

- Calendar - for "REAL" programmers
- Canny edge detector
- Cantor set
- Cartesian product of two or more lists
- Catmull–Clark subdivision surface
- Check Machin-like formulas
- Checkpoint synchronization
- Church Numerals
- Closest-pair problem
- Color quantization
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Commatizing numbers
- Compare a list of strings
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Conjugate transpose
- Continued fraction/Arithmetic/Construct from rational number
- Convert seconds to compound duration
- Cramer's rule
- Currency
- Cut a rectangle

### D

- De Bruijn sequences
- Death Star
- Deconvolution/2D+
- Delegates
- Deming's Funnel
- Department Numbers
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if a string is collapsible
- Determine if a string is squeezable
- Dijkstra's algorithm
- Dinesman's multiple-dwelling problem
- Discordian date
- Dragon curve
- Draw a rotating cube
- Dutch national flag problem

### E

### F

- FTP
- Factorial base numbers indexing permutations of a collection
- Fibonacci word
- Fibonacci word/fractal
- File extension is in extensions list
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- First-class functions/Use numbers analogously
- First class environments
- First perfect square in base N with N unique digits
- Fixed length records
- Flipping bits game
- Floyd-Warshall algorithm
- Formal power series
- Four is magic
- Four is the number of letters in the ...
- Fractal tree
- Fraction reduction
- Fractran
- Function frequency
- Functional coverage tree

### G

### H

### I

- I before E except after C
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Image convolution
- Imaginary base numbers
- Index finite lists of positive integers
- Inheritance/Multiple
- Intersecting Number Wheels
- Inverted index
- Iterated digits squaring

### K

- K-d tree
- K-means++ clustering
- Kernighans large earthquake problem
- Keyboard input/Keypress check
- Keyboard input/Obtain a Y or N response
- Keyboard macros
- Knapsack problem/0-1
- Knapsack problem/Bounded
- Knapsack problem/Continuous
- Knapsack problem/Unbounded
- Knight's tour
- Knuth's algorithm S
- Knuth's power tree
- Kolakoski sequence
- Kosaraju
- Kronecker product
- Kronecker product based fractals

### L

### M

- Magic squares of doubly even order
- Magic squares of singly even order
- Make directory path
- Mastermind
- Matrix-exponentiation operator
- Matrix Digital Rain
- Matrix chain multiplication
- Mayan numerals
- Maze solving
- McNuggets Problem
- Median filter
- Metered concurrency
- Metronome
- Mian-Chowla sequence
- Mind boggling card trick
- Minesweeper game
- Morse code
- Mouse position
- Move-to-front algorithm
- Multi-dimensional array
- Multiple regression
- Multiplicative order
- Munching squares

### N

### O

### P

- P-value correction
- Parallel Brute Force
- Parallel calculations
- Parametrized SQL statement
- Parse an IP Address
- Partial function application
- Partition an integer X into N primes
- Pascal matrix generation
- Password generator
- Pathological floating point problems
- Pattern matching
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Penney's game
- Pentagram
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect shuffle
- Permutations/Derangements
- Permutations/Rank of a permutation
- Phrase reversals
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Plot coordinate pairs
- Poker hand analyser
- Polynomial long division
- Polynomial regression
- Polyspiral
- Pragmatic directives
- Prime conspiracy
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Pythagoras tree

### R

- RCRPG
- RPG Attributes Generator
- RSA code
- Range consolidation
- Ranking methods
- Rare numbers
- Rate counter
- Ray-casting algorithm
- Read a configuration file
- Recaman's sequence
- Reduced row echelon form
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Remove lines from a file
- Rendezvous
- Resistor mesh
- Respond to an unknown method call
- Retrieve and search chat history
- Rock-paper-scissors
- Roots of a quadratic function
- Rosetta Code/Find bare lang tags
- Rosetta Code/Fix code tags
- Runtime evaluation
- Runtime evaluation/In an environment

### S

- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Same Fringe
- Scope/Function names and labels
- Search a list of records
- Secure temporary file
- Self-referential sequence
- Send an unknown method call
- Sequence: nth number with exactly n divisors
- Sequence of primorial primes
- Set of real numbers
- Set puzzle
- Seven-sided dice from five-sided dice
- Sexy primes
- Shortest common supersequence
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simple database
- Simulate input/Mouse
- Smarandache prime-digital sequence
- Sokoban
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Sort a list of object identifiers
- Sort numbers lexicographically
- Sort three variables
- Sorting algorithms/Patience sort
- Sorting algorithms/Radix sort
- Soundex
- Special variables
- Speech synthesis
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Square-free integers
- Stable marriage problem
- State name puzzle
- Statistics/Normal distribution
- Stern-Brocot sequence
- Straddling checkerboard
- Stream Merge
- Strong and weak primes
- Subleq
- Subtractive generator
- Successive prime differences
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sunflower fractal
- Super-d numbers
- Superellipse
- Sutherland-Hodgman polygon clipping

### T

### U

### V

### W

### Draft tasks without implementation[edit]

These tasks are drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Nim (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.

### 2

### A

### B

### C

- Card shuffles
- Chebyshev coefficients
- Check input device is a terminal
- Check output device is a terminal
- Checksumcolor
- Chernick's Carmichael numbers
- Cheryl's Birthday
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Cipolla's algorithm
- Code segment unload
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Curve that touches three points
- Cycle detection

### D

### E

### F

- Faces from a mesh
- Factorions
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat numbers
- Fibonacci heap
- File size distribution
- Find URI in text
- Find duplicate files
- Find first and last set bit of a long integer
- Find the intersection of a line with a plane
- Finite state machine
- Free polyominoes enumeration
- French Republican calendar

### G

### H

### I

### L

### M

- Magic 8-Ball
- Make a backup file
- Markov chain text generator
- Mayan calendar
- Mersenne primes
- Metallic ratios
- Modular arithmetic
- Modulinos
- Monads/List monad
- Monads/Maybe monad
- Montgomery reduction
- Morpion solitaire
- Most frequent k chars distance
- Multidimensional Newton-Raphson method
- Multiline shebang
- Musical scale

### N

### O

### P

- Palindromic gapful numbers
- Parse EBNF
- Particle Swarm Optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Perlin noise
- Permutations with repetitions
- Permutations with some identical elements
- Pierpont primes
- Playfair cipher
- Polynomial synthetic division
- Print debugging statement
- Process SMIL directives in XML data
- Proof

### R

- Railway circuit
- Ramanujan's constant
- Ramsey's theorem
- Random Latin Squares
- Raster bars
- Read a file character by character/UTF8
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Repeat
- Resistance Network Calculator
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Rosetta Code/Tasks without examples
- Run as a daemon or service

### S

- Safe mode
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Sine wave
- Singly-linked list/Element removal
- Snake
- Snake And Ladder
- Solve a Rubik's Cube
- Solving coin problems
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Starting a web browser
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Subset sum problem
- Substitution Cipher
- Suffix tree
- Sum data type

### T

- Table creation
- Tamagotchi emulator
- Teacup rim text
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text between
- Text to HTML
- Time-based One-time Password Algorithm
- Topological sort/Extracted top item
- Transportation problem
- Tree datastructures
- Type detection

### U

### W

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Nim, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.

### Other pages[edit]

These are other pages related to Nim which require attention; with your knowledge and assistance, we can improve the quality of the site's content.

### No pages found.

## Not Considered[edit]

These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Nim was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.

### No pages found.

## End of List[edit]

Again, feel free to try your hand at any of the tasks listed on this page.