2D CUI - C++ Snake Game Tutorial + Source Code

 Snake Game Tutorial + Source Code 

Snake Game Is a Very Old and Popular Game but it Become more Interesting When You Create it. Snake first appeared in 1997 on the Nokia 6110, along with the games Logic and Memory. It was programmed by Taneli Armanto, a design engineer in Nokia. 

Snake Game Could Be a best Idea When Working In Small And Effective Project, it consumes only Approx 150 lines of code to built this app / game. 

It Includes Logic ,Draw and Loops Parts, making this game is more Interesting for Understanding Game building Concepts and Enhancing Programming Skills. 

 NOTE 

- This Snake Game does not include Concept of Object Oriented Programming
- It does not include Data File Handling , linked lists , Dynamic Memory Allocation , Stacks and Queue
- Game is Build with With Basic C++ Concepts.

 SOURCE CODE 

#include <iostream> #include <conio.h> #include <stdlib.h> #include <cstdlib> using namespace std; bool gameover; const int width = 20; const int height = 20; int x, y, fruitX, fruitY, score; int tailX[100], tailY[100]; int nTail; enum eDirecton { STOP = 0, LEFT, RIGHT, UP, DOWN}; eDirecton dir; void Setup() { gameover = false; dir = STOP; x = width / 2; y = height / 2; fruitX = rand() % width; fruitY = rand() % height; score = 0; } void Draw() { system("cls"); for (int i = 0; i < width-8; i++) cout << "[]"; cout << endl; for (int i = 0; i < height-1 ; i++) { for (int j = 0; j < width; j++) { if (j == 0) cout << "[]"; if (i == y && j == x) cout << "O"; else if (i == fruitY && j == fruitX) cout << "$"; else { bool print = false; for (int k = 0; k < nTail; k++) { if (tailX[k] == j && tailY[k] == i) { cout << "o"; print = true; } } if (!print) cout << " "; } if (j == width-1) cout << "[]"; } cout << endl; } for (int i = 0; i < width-8; i++) cout << "[]"; cout << endl; cout << "\tSCORE:" << score << endl; } void Input() { if (_kbhit()) { switch (_getch()) { case 'a': dir = LEFT; break; case 'd': dir = RIGHT; break; case 'w': dir = UP; break; case 's': dir = DOWN; break; case 'x': gameover = true; break; } } } void Logic() { int prevX = tailX[0]; int prevY = tailY[0]; int prev2X, prev2Y; tailX[0] = x; tailY[0] = y; for (int i = 1; i < nTail; i++) { prev2X = tailX[i]; prev2Y = tailY[i]; tailX[i] = prevX; tailY[i] = prevY; prevX = prev2X; prevY = prev2Y; } switch (dir) { case LEFT: x--; break; case RIGHT: x++; break; case UP: y--; break; case DOWN: y++; break; default: break; } if (x > width-1 || x < 0 || y > height-2 || y < 0) gameover = true; for (int i = 0; i < nTail; i++) if (tailX[i] == x && tailY[i] == y) gameover = true; if (x == fruitX && y == fruitY) { score += 10; fruitX = rand() % width; fruitY = rand() % height; nTail++; } } int main() { Setup(); while (!gameover) { Draw(); Input(); Logic(); _sleep(20); } return 0; }

Video References: