-
Notifications
You must be signed in to change notification settings - Fork 0
/
main code
216 lines (168 loc) · 5.72 KB
/
main code
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
// Node structure
struct Node {
int position;
int weight;
struct Node* next;
};
// Player structure
struct Player {
char name[50];
int position;
int score;
int rolls;
};
// Function to roll a six-sided die
int rollDie() {
return rand() % 6 + 1;
}
// Function to print the board
void printBoard(struct Player* players, int numPlayers) {
for (int row = 9; row >= 0; row--) {
for (int col = 1; col <= 10; col++) {
int position = row * 10 + col;
int playerPresent = 0;
for (int i = 0; i < numPlayers; i++) {
if (players[i].position == position) {
printf("#%s\t", players[i].name);
playerPresent = 1;
break;
}
}
if (!playerPresent) {
printf("%d\t", position);
}
}
printf("\n\n");
}
}
// Function to move the player
void movePlayer(struct Player* player, int roll, struct Node* snakesAndLadders) {
printf("%s rolled a %d.\n", player->name, roll);
player->rolls++;
int newPosition = player->position + roll;
struct Node* current = snakesAndLadders;
while (current != NULL) {
if (current->position == newPosition) {
printf("Encountered a snake or ladder at position %d.\n", newPosition);
player->position += current->weight;
if (current->weight > 0) {
printf("Climbed a ladder! +%d marks.\n", current->weight);
player->score += current->weight;
} else {
printf("Encountered a snake! -%d marks.\n", abs(current->weight));
player->score -= abs(current->weight);
}
return;
}
current = current->next;
}
player->position = newPosition;
if (player->position > 100) {
player->position = 100;
}
}
// Function to print a message when a player wins
void declareWinner(struct Player player) {
printf("Congratulations, %s! You won with a score of %d and took %d rolls.\n", player.name, player.score, player.rolls);
}
// Function to free the allocated memory for the linked list
void freeLinkedList(struct Node* head) {
while (head != NULL) {
struct Node* temp = head;
head = head->next;
free(temp);
}
}
// Function to create the linked list based on difficulty level
struct Node* createSnakesAndLadders(int difficulty) {
struct Node* head = NULL;
struct Node* ladder1 = (struct Node*)malloc(sizeof(struct Node));
ladder1->position = 6;
ladder1->weight = 40;
ladder1->next = NULL;
struct Node* snake1 = (struct Node*)malloc(sizeof(struct Node));
snake1->position = 23;
snake1->weight = -10;
snake1->next = NULL;
ladder1->next = snake1;
if (difficulty == 1) {
// Easy level
struct Node* ladder2 = (struct Node*)malloc(sizeof(struct Node));
ladder2->position = 32;
ladder2->weight = 25;
ladder2->next = NULL;
struct Node* snake2 = (struct Node*)malloc(sizeof(struct Node));
snake2->position = 45;
snake2->weight = -15;
snake2->next = NULL;
snake1->next = ladder2;
ladder2->next = snake2;
} else if (difficulty == 2) {
// Medium level
struct Node* ladder3 = (struct Node*)malloc(sizeof(struct Node));
ladder3->position = 15;
ladder3->weight = 30;
ladder3->next = NULL;
struct Node* snake3 = (struct Node*)malloc(sizeof(struct Node));
snake3->position = 40;
snake3->weight = -20;
snake3->next = NULL;
snake1->next = ladder3;
ladder3->next = snake3;
} else {
// Hard level
struct Node* ladder4 = (struct Node*)malloc(sizeof(struct Node));
ladder4->position = 50;
ladder4->weight = 20;
ladder4->next = NULL;
struct Node* snake4 = (struct Node*)malloc(sizeof(struct Node));
snake4->position = 75;
snake4->weight = -25;
snake4->next = NULL;
snake1->next = ladder4;
ladder4->next = snake4;
}
head = ladder1;
return head;
}
int main() {
srand(time(0)); // Initialize random seed for rand
int numPlayers;
printf("Enter the number of players: ");
scanf("%d", &numPlayers);
struct Player* players = (struct Player*)malloc(numPlayers * sizeof(struct Player));
for (int i = 0; i < numPlayers; i++) {
printf("Enter name for Player %d: ", i + 1);
scanf("%s", players[i].name);
players[i].position = 1;
players[i].score = 0;
players[i].rolls = 0;
}
int currentPlayer = 0;
int won = 0;
int difficulty;
printf("Choose difficulty level (1: Easy, 2: Medium, 3: Hard): ");
scanf("%d", &difficulty);
struct Node* snakesAndLadders = createSnakesAndLadders(difficulty);
printf("Snake and Ladder Game\n");
while (!won) {
printf("\n%s, press Enter to roll the die...", players[currentPlayer].name);
getchar();
int roll = rollDie();
movePlayer(&players[currentPlayer], roll, snakesAndLadders);
printf("%s is now at position %d with a score of %d.\n\n", players[currentPlayer].name, players[currentPlayer].position, players[currentPlayer].score);
printBoard(players, numPlayers);
if (players[currentPlayer].position == 100) {
declareWinner(players[currentPlayer]);
won = 1;
}
// Switch to the next player
currentPlayer = (currentPlayer + 1) % numPlayers;
}
freeLinkedList(snakesAndLadders);
free(players);
return 0;
}