A Tryst With Chess- Coding challenge Solved with Backtracking Algorithm | Developed by PY.

Today I m posting solution developed by me for this coding challenge. Got Crazy with the Backtracking Algorithm.

PROBLEM STATEMENT: 

You are given a 10X10 chessboard with a knight on coordinate (I,J). You have to find the number of blocks on the chessboard that the knight can be at in exactly N moves.

NOTE:

The knight can move from its position in the diagram to all the coordinates marked by X
in the following diagram in one move. For the 10X10 chessboard (1,1) is the top-left corner,(1,10) is the top-right corner and (10,10) is the bottom-right corner.

INPUT :

Input will consist of three space separated integers I
,J,N

N is less than 10.

OUTPUT:
Print a single integer denoting the number of blocks on the chessboard that the knight can be at in exactly N
moves.

Sample Input: 3 3 1
Sample Output: 8

pyslidegrabber | My Tool that downloads slides from specified slide link of slideshare website by bypassing its authentication( No need to Login/Signup )

Hello All,

               Somedays back I was surfing over www.slideshare.net website. Then at the moment I clicked on download button on the webpage. It started to ask authentication details.Then I thought to create a tool which is capable of grabbing slides by bypassing the security. So I started my work on building this tool. I have used NodeJS framework.

I named the tool as pyslidegrabber. Developed By PY.
 
I felt excited once it started to work. Let's see how my tool actually works.....

Soo... This is how the pyslidegrabbber tool it actually works.

Thank You.