Closed

Path possibilities based on type of Grid

This project received 25 bids from talented freelancers with an average bid price of $24 USD.

Get free quotes for a project like this
Employer working
Project Budget
$10 - $30 USD
Total Bids
25
Project Description

Hello,

I'm looking for a Freelancer with expertise in programming to create an algorithm to produce output based on the problem statement provided. Each of the output must be represented visually. Basic example of a problem statement:

How many paths can 2 x 2 grid have starting from the first block to the last block? Four blocks in the grid (row 1 col 1, row 1 col 2, row 2 col 1, row 2 col 2).

Answer: Two paths:
1). row 1 col 1 then row 1 col 2 then row 2 col 2
2). row 1 col 1 then row 2 col 1 then row 2 col 2

(Rules: 1). the paths cannot be diagonal. 2). the path cannot be backwards (i.g cannot be from last block to the first block).

I need the solution for 14 different sizes of grid.

Please let me know if you have any questions.

RS

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online