# Project for Techconfer

Hello i have the following project for 2 prolog programs :

1) Given a maze from a file N*M where allowed cells is marked with . and barriers with X , Start is with S and end is with E , find the shortest path from S to E.

Moves Right and Down cost 1 , Left costs 2 and Up costs 3 .

Solution must be as follows :

?-moredeli('[url removed, login to view]',Cost, Solution).

Cost= 16,

Solution= [u, r, r, r, d, d, d, l, l, u].

\$cat [url removed, login to view]

....

SX..

XEX.

....

The solution already exists in sml if that helps in any way

2) A transform of the problem of count ways to reach nth stair .

In this transformation you get from a file the number of stairs , the number of ways you can move and the number of broken stairs . After that in the input file there are the number of stairs you can climb (ie 1 4 7 ) and then the broken stairs (ie 3 5 6)

The solution should be the number of ways you can reach the nth stair given the fact that there are some broken stairs and you can move certain ways (ie you can go in 3 stair ,5 stairs or 6 stairs ).

\$cat [url removed, login to view]

10 3 4

1 2 4 (you can climb 1 2 or 4 stairs at a time)

2 4 6 7 (stairs 2,4,6,7 are broken )

Skills: Android, C++ Programming, Data Entry, Prolog, Python