# Reports:Tasks not implemented in Tcl

**Awareness**

If

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

## Contents

## Not implemented[edit]

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

### 2

### A

### B

### C

- Calkin-Wilf sequence
- Canonicalize CIDR
- Cantor set
- Chaocipher
- Chaos game
- Chernick's Carmichael numbers
- Cheryl's birthday
- Chowla numbers
- Church numerals
- Circular primes
- Cistercian numerals
- Color wheel
- Commatizing numbers
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Cuban primes
- Cyclotomic polynomial

### D

### E

### F

- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Fairshare between two and more
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Find the intersection of a line with a plane
- Find the intersection of two lines
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fivenum
- Four is magic
- Four is the number of letters in the ...
- Fraction reduction
- French Republican calendar
- Functional coverage tree

### I

### L

### M

- Magic 8-ball
- Magic squares of doubly even order
- Magic squares of singly even order
- Mastermind
- Matrix chain multiplication
- Matrix digital rain
- Mayan numerals
- McNuggets problem
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Mian-Chowla sequence
- Mind boggling card trick
- Minimal steps down to 1
- Minkowski question-mark function
- Modified random distribution
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Munchausen numbers

### N

### P

- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindromic gapful numbers
- Pancake numbers
- Parallel brute force
- Partition an integer x into n primes
- Partition function P
- Password generator
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Perfect totient numbers
- Pierpont primes
- Plasma effect
- Polyspiral
- Primality by Wilson's theorem
- Prime conspiracy
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
- Pythagorean quadruples

### R

### S

- SHA-256 Merkle tree
- Safe primes and unsafe primes
- Self numbers
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence of primorial primes
- Sexy primes
- Shoelace formula for polygonal area
- Sierpinski pentagon
- Smarandache prime-digital sequence
- Sort an outline at every level
- Sort numbers lexicographically
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cocktail sort with shifting bounds
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Square Form Factorization
- Square but not cube
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Sum and product puzzle
- Sunflower fractal
- Super-d numbers
- Superellipse
- Superpermutation minimisation

### T

### 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 Tcl (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.

### A

### B

### C

- CLI-based maze-game
- Change e letters to i in words
- Changeable words
- Chebyshev coefficients
- Checksumcolor
- Chemical calculator
- Chess player
- Cipolla's algorithm
- Combinations with repetitions/Square digit chain
- Common list elements
- Common sorted list
- Compiler/Verifying syntax
- Consecutive Primes With Ascending Or Descending Differences
- Coprimes
- Count the coins/0-1
- Cousin primes
- Cubic Special Primes
- Curve that touches three points
- Cycle detection

### D

### F

- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find first missing positive
- Find if a point is within a triangle
- Find prime n for that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words which contains most consonants
- Find words which first and last three letters are equals
- Find words with alternating vowels and consonants
- Finite state machine
- Free polyominoes enumeration
- Frobenius numbers

### G

### L

### M

### N

- Native shebang
- Neighbour primes
- Next special primes
- Nice primes
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers which binary and ternary digit sum are prime
- Numbers with equal rises and falls
- Numbers with prime digits whose sum is 13
- Numeric separator syntax
- Numerical integration/Adaptive Simpson's method

### P

- Palindromic primes
- Particle swarm optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Permutations with some identical elements
- Piprimes
- Pisano period
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime triplets
- Prime words
- Primes which sum of digits is 25
- Primes with digits in nondecreasing order
- Print debugging statement
- Print itself
- Product of divisors
- Pseudo-random numbers/Splitmix64
- Pseudorandom number generator image

### R

### S

- Safe mode
- Sattolo cycle
- Selective file copy
- Self-hosting compiler
- Shift list elements to left by 3
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski arrowhead curve
- Sierpinski curve
- Sierpinski square curve
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Snake
- Snake and Ladder
- Solve a Rubik's Cube
- Solve triangle solitare puzzle
- Solving coin problems
- Sorting algorithms/Tree sort on a linked list
- Special Divisors
- Special factorials
- Spoof game
- Square root by hand
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- Strassen's algorithm
- Substring primes
- Suffix tree
- Sum data type
- Sum of divisors
- Sum of the digits of n is substring of n
- Summarize primes

### T

### U

### W

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Tcl, 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.

### A

### D

### M

### P

### Other pages[edit]

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

## Not Considered[edit]

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

## End of List[edit]

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