C# Knights Moves of 10

I want to find all 10-key sequences that can be keyed into the keypad in the following manner:

• The initial keypress can be any of the keys.

• Each subsequent keypress must be a knight move from the previous keypress.

• There can be at most 2 vowels in the sequence.

A knight move is made in one of the following ways:

1. Move two steps horizontally and one step vertically.

2. Move two steps vertically and one step horizontally.

There is no wrapping allowed on a knight move.

A Key is allowed to be used more than once

The program should first write the number of valid 10-key sequences on a single line to standard out using C#

## Deliverables

| A | B | C | D | E |

| F | G | H | I | J |

| K | L | M | N | O |

| | 1 | 2 | 3 | |

Sample Key Pad

Sample Moves

A to L, L to 3

G to 2

Keahlian .NET, Pemrograman C#, Teknik, MySQL, PHP, Perancangan Perangkat Lunak, Pengujian Perangkat Lunak, Visual Basic

Lihat lebih lanjut: program knights move vowels, knight moves, knights sequence, knight sequence keypad, wrapping allowed, subsequent keypress must knight move previous keypress, wrapping allowed knight move, knights move vowels program, knight key sequences, knights move keypad, 10 keypad, knights, knight, c&j, find sequence, can program keypad, using pad, program keypad, keypad program

Tentang Pemberi kerja:
( 0 ulasan ) United States

ID Proyek: #3806531

4 freelancer menawar pada rata-rata $66 untuk pekerjaan ini


See private message.

$85 USD dalam 1 hari
(107 Ulasan)

See private message.

$42.5 USD dalam 1 hari
(52 Ulasan)

See private message.

$85 USD dalam 1 hari
(24 Ulasan)

See private message.

$51 USD dalam 1 hari
(21 Ulasan)