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
|
/* Tenes Empanadas Graciela
*
* Copyright (C) 2000 Ricardo Quesada
*
* Author: Ricardo Calixto Quesada <rquesada@core-sdi.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; only version 2 of the License
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
*/
/**
* @file canje.c
* @brief Client side card management.
*/
#include <filesystem>
#include "../common/net.h"
#include "protocol.h"
#include "fcintl.h"
#include "client.h"
namespace teg::client
{
TEG_STATUS canje_out(int p1, int p2, int p3)
{
if(!ESTADO_ES(PLAYER_STATUS_FICHASC)) {
textmsg(M_ERR, _("Error, its not the moment to exchange the cards"));
return TEG_STATUS_ERROR;
}
if(tarjeta_puedocanje(WHOAMI(), p1, p2, p3)) {
net_printf(g_game.fd, TOKEN_CANJE"=%d,%d,%d\n", p1, p2, p3);
tarjeta_poner(&g_countries[p1].tarjeta);
tarjeta_poner(&g_countries[p2].tarjeta);
tarjeta_poner(&g_countries[p3].tarjeta);
return TEG_STATUS_SUCCESS;
} else {
textmsg(M_ERR, _("Error, the cards must be all equal, or all different"));
return TEG_STATUS_ERROR;
}
}
/**
* @fn TEG_STATUS canje_puedo(int *p1, int *p2, int *p3)
* Dice si se puede hacer canje, y devuelve una posible combinacion
* de tarjetas
*/
TEG_STATUS canje_puedo(int *p1, int *p2, int *p3)
{
if(g_game.tarjetas_cant < 3) {
return TEG_STATUS_ERROR;
}
int a[maximum_country_cards];
for(int& ai: a) {
ai = -1;
}
unsigned index=0;
countries_map([&a, &index](COUNTRY& country) {
if((country.tarjeta.numjug == WHOAMI())
&& (index < std::extent<decltype(a)>::value)) {
a[index] = country.id;
index++;
}
});
for(int i=0; i<g_game.tarjetas_cant; i++) {
for(int j=i+1; j<g_game.tarjetas_cant; j++) {
for(int k=j+1; k<g_game.tarjetas_cant; k++) {
if(tarjeta_puedocanje(g_game.numjug, a[i], a[j], a[k])) {
if(p1) {
*p1 = a[i];
}
if(p2) {
*p2 = a[j];
}
if(p3) {
*p3 = a[k];
}
return TEG_STATUS_SUCCESS;
}
}
}
}
return TEG_STATUS_ERROR;
}
}
|
