From c7013d3b1b2899d6b51a00d537b02ddae1b0ac63 Mon Sep 17 00:00:00 2001
From: Bhrigu Kansra <bhrigukansra@programmer.net>
Date: Tue, 2 Oct 2018 00:17:59 +0530
Subject: [PATCH] Revert "Added 3 backtrack algorithms."

---
 contributors.md   |   5 +--
 knight-tour.cpp   |  59 --------------------------
 n-queen.cpp       |  58 -------------------------
 rat_in_a_maze.cpp | 105 ----------------------------------------------
 4 files changed, 1 insertion(+), 226 deletions(-)
 delete mode 100644 knight-tour.cpp
 delete mode 100644 n-queen.cpp
 delete mode 100644 rat_in_a_maze.cpp

diff --git a/contributors.md b/contributors.md
index 125d814..6a46934 100644
--- a/contributors.md
+++ b/contributors.md
@@ -1,6 +1,5 @@
 # List of all contributors
 
-
 1.  [Bhrigu Kansra](https://github.com/kinetickansra)
 2.  [Tathya Thaker](https://github.com/thetathya)
 3.  [Aslan](https://github.com/impeccableaslan)
@@ -11,8 +10,6 @@
 8.  [Joy Banerjee](https://github.com/joybanerjee08)
 9.  [Ambika](https://github.com/Ambika55)
 10. [Shivam Yadav](https://github.com/shivamyadav2512)
-11. [Nikhil Arora](https://github.com/nikhilarora06
-
-12. [Your Name](https://github.com/yourprofile)
 
+11. [Your Name](https://github.com/yourprofile)
 
diff --git a/knight-tour.cpp b/knight-tour.cpp
deleted file mode 100644
index 978a2d3..0000000
--- a/knight-tour.cpp
+++ /dev/null
@@ -1,59 +0,0 @@
-#include<bits/stdc++.h>
-# define n 8
-using namespace std;
-bool issafe(int x,int y,int sol[n][n])
-{
-    return (x<n && x>=0 && y<n && y>=0 && sol[x][y]==-1);
-
-}
-bool solve(int x,int y, int mov, int sol[n][n], int xmov[n], int ymov[n])
-{
-    int k,xnext,ynext;
-
-    if(mov == n*n)
-        return true;
-
-    for(k=0;k<8;k++)
-    {
-        xnext=x+xmov[k];
-        ynext=y+ymov[k];
-
-        if(issafe(xnext,ynext,sol))
-            {
-                sol[xnext][ynext]=mov;
-
-                if(solve(xnext,ynext,mov+1,sol,xmov,ymov)==true)
-                    return true;
-                else
-                    sol[xnext][ynext]=-1;
-            }
-    }
-    return false;
-}
-int main()
-{
-    //initialize();
-
-    int sol[n][n];
-    int i,j;
-    for(i=0;i<n;i++)
-        for(j=0;j<n;j++)
-            sol[i][j]=-1;
-
-    int xmov[8] = {  2, 1, -1, -2, -2, -1,  1,  2 };
-    int ymov[8] = {  1, 2,  2,  1, -1, -2, -2, -1 };
-    sol[0][0]=0;
-
-    bool flag=solve(0,0,1,sol,xmov,ymov);
-    if(flag==false)
-        cout<<"solution doesnot exist \n";
-    else
-    {
-        for(i=0;i<n;i++)
-        {
-            for(j=0;j<n;j++)
-                cout<<sol[i][j]<<"  ";
-            cout<<"\n";
-        }
-    }
-}
diff --git a/n-queen.cpp b/n-queen.cpp
deleted file mode 100644
index d896365..0000000
--- a/n-queen.cpp
+++ /dev/null
@@ -1,58 +0,0 @@
-#include<bits/stdc++.h>
-#define n 4
-using namespace std;
-bool issafe(int board[n][n], int row, int col)
-{
-    int i,j;
-    for(i=0;i<n;i++)
-        if(board[row][i])
-            return false;
-    for(i=row,j=col;i>=0 && j>=0;i--,j--)
-        if(board[i][j])
-            return false;
-    for(i=row,j=col;i<n && j>=0; i++,j--)
-        if(board[i][j])
-            return false;
-
-    return true;
-}
-bool solve(int board[n][n], int col)
-{
-    if(col>=n)
-        return true;
-    int i;
-    for(i=0;i<n;i++)
-    {
-        if(issafe(board, i ,col))
-            {
-                board[i][col]=1;
-
-                if(solve(board, col+1))
-                    return true;
-
-                board[i][col]=0;
-            }
-    }
-    return false;
-}
-int main()
-{
-    int board[n][n]={{0,0,0,0},
-                    {0,0,0,0},
-                    {0,0,0,0},
-                    {0,0,0,0}};
-    bool flag;
-    int i,j;
-    flag=solve(board,0);
-    if(flag==false)
-        cout<<"solution doesnot exist \n";
-    else
-    {
-        for(i=0;i<n;i++)
-        {
-            for(j=0;j<n;j++)
-                cout<<board[i][j]<<" ";
-        cout<<"\n";
-        }
-    }
-}
diff --git a/rat_in_a_maze.cpp b/rat_in_a_maze.cpp
deleted file mode 100644
index f376032..0000000
--- a/rat_in_a_maze.cpp
+++ /dev/null
@@ -1,105 +0,0 @@
-#include<bits/stdc++.h>
-#define n 4
-using namespace std;
-
-int sol[n][n]= {{0,0,0,0},
-                {0,0,0,0},
-                {0,0,0,0},
-                {0,0,0,0,}};
-
-void print(int sol[n][n]);
-
-int issafe(int maze[n][n], int row, int col)
-{
-    if(row>=0 && row<n && col>=0 && col<n && maze[row][col]==1)
-            return 1;
-    return 0;
-}
-
-int solvemaze(int maze[n][n], int row, int col, int sol[n][n])
-{
-    if(row==n-1 && col==n-1)
-    {
-        sol[row][col]=1;
-
-        return 1;
-    }
-
-    if(issafe(maze,row,col) == 1)
-    {
-
-        sol[row][col]=1;
-        print(sol);
-
-        if(solvemaze(maze, row, col+1,sol) == 1)
-        {
-            return 1;
-        }
-        if(solvemaze(maze, row+1, col,sol) == 1)
-        {
-            return 1;
-        }
-        else
-        {
-            cout<<"Backtracking step \n";
-            print(sol);
-            sol[row][col]=0;
-            return 0;
-        }
-    }
-    return 0;
-}
-
-
-void print(int sol[n][n])
-{
-    int i,j;
-
-    for(i=0;i<n;i++)
-    {
-        cout<<"|";
-        for(j=0;j<n;j++)
-        {
-            cout<<" "<<sol[i][j]<<" |";
-        }
-        cout<<"\n";
-    }
-    cout<<"\n\n";
-}
-int main()
-{
-
-    /*int maze[n][n]={{1,1,1,0,0,1,1,1},
-                    {0,0,1,1,0,0,0,0},
-                    {0,0,1,0,0,0,0,0},
-                    {0,1,1,1,0,0,0,0},
-                    {0,0,0,1,0,0,0,0},
-                    {0,0,0,1,0,1,1,1},
-                    {0,0,0,1,0,1,0,1},
-                    {0,0,0,1,1,1,0,1}};
-
-
-    int sol[n][n] ={{0,0,0,0,0,0,0,0},
-                    {0,0,0,0,0,0,0,0},
-                    {0,0,0,0,0,0,0,0},
-                    {0,0,0,0,0,0,0,0},
-                    {0,0,0,0,0,0,0,0},
-                    {0,0,0,0,0,0,0,0},
-                    {0,0,0,0,0,0,0,0},
-                    {0,0,0,0,0,0,0,0}};*/
-
-        int maze[n][n]={{1,1,1,0},
-                        {0,1,0,1},
-                        {0,1,1,0},
-                        {0,1,1,1}};
-
-
-    cout<<"Maze"<<"\n";
-    print(maze);
-
-    solvemaze(maze,0,0,sol);
-
-
-    print(sol);
-
-}