chess_game_engine/main.cpp at main · saranathrajaram11/chess_game_engine · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include<bits/stdc++.h>
using namespace std;

class chess{
  public:
     static const int rows=8,cols=8;
     char arr[rows][cols];
     char peices[13]={'p','r','n','b','q','k','P','R','N','B','Q','K','.'};
     void assign_board()
     {
      int i,j;
      for(i=0;i<rows;i++)
      {
        for(j=0;j<cols;j++)
        {
          arr[i][j]=peices[12];
        }cout<<endl;
      }
      for(int k=0;k<rows;k++)
      {
        arr[1][k]=peices[0];
        arr[6][k]=peices[6];
      }
     /* for black side*/
     arr[0][0]=peices[1];
     arr[0][7]=peices[1];
     arr[0][1]=peices[2];
     arr[0][6]=peices[2];
     arr[0][2]=peices[3];
     arr[0][5]=peices[3];
     arr[0][3]=peices[4];
     arr[0][4]=peices[5];
     /* for white side*/
     arr[7][0]=peices[7];
     arr[7][7]=peices[7];
     arr[7][1]=peices[8];
     arr[7][6]=peices[8];
     arr[7][2]=peices[9];
     arr[7][5]=peices[9];
     arr[7][3]=peices[10];
     arr[7][4]=peices[11];
     }

     void print_board()
     {
      for(int m=0;m<rows;m++)
      {
        for(int n=0;n<cols;n++)
        {
          cout<<arr[m][n];
        }cout<<endl;
      }
     }

     vector<std::pair<int , int>> knight_moves(int m, int n)
     {
      vector <std::pair<int, int>> moves={
        {m + 2, n + 1}, {m + 2, n - 1}, {m - 2, n + 1}, {m - 2, n - 1},
        {m + 1, n + 2}, {m + 1, n - 2}, {m - 1, n + 2}, {m - 1, n - 2}
      } ;
      vector<std::pair<int,int>> true_moves;
      for(auto m :moves)
      {
int new_m =m.first, new_n=m.second;
  if (new_m >= 0 && new_m < rows && new_n >= 0 && new_n < cols)
{
  true_moves.push_back({new_m,new_n});
}

      }
      return true_moves;
     }

};


int main()
{
  chess c;
  c.assign_board();
  c.print_board();
  int k_m,k_n;
  cin >> k_m >>k_n;
  vector<std::pair<int,int>>  movee=c.knight_moves(k_m,k_n);
  for(auto f : movee)
  {
    cout<<"("<<f.first <<" "<<f.second<<")";
  }
  return 0;

}