Ewerton / NumpadChessBlazorServer

Checks how many n digits unique phone number can be discovered in a phone numpad using chess pieces movements

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

NumpadChessBlazorServer

This program discovers all the possible n digit numbers that can be made from the digits on a standard telephone keypad.

  • Only movement patterns of the chess pieces are allowed.
  • You cannot start with one or zero
  • The * and the # are considered invalid positions.

Here are the results achieved for a 7 digits number, for all chess pieces:

Knight

Starting from Combinations
2 104
3 136
4 168
5 0
6 168
7 136
8 104
9 136
Total 952

Bishop

Starting from Combinations
2 64
3 415
4 64
5 654
6 64
7 508
8 64
9 508
Total 2341

Rook

Starting from Combinations
2 7117
3 5995
4 5595
5 7117
6 5595
7 5595
8 7117
9 5595
Total 49726

Pawn

Starting from Combinations
any number 0
Total 0

Queen

Starting from Combinations
2 93279
3 84898
4 85048
5 117849
6 85048
7 94740
8 95901
9 94740
Total 751503

King

Starting from Combinations
2 15265
3 10811
4 15984
5 22611
6 15984
7 13138
8 17977
9 13138
Total 124908

About

Checks how many n digits unique phone number can be discovered in a phone numpad using chess pieces movements


Languages

Language:C# 83.5%Language:HTML 10.8%Language:CSS 5.4%Language:JavaScript 0.3%