LEGO

[....][00][00][2k+4][00][00][....]

[01][00][00][........][00][00][10]

[00][00][00][2k+6][00][00][00]

[....][00][00][2k+5][00][00][....]

[01][00][00][........][00][00][10]

[00][00][00][2k+7][00][00][00]

LEGO

[....][....][00][4k+2][00][....][....]

[02][03][00][........][00][30][20]

[00][00][00][4k+6][00][00][00]

[....][....][00][4k+3][00][....][....]

[02][03][00][........][00][30][20]

[00][00][00][4k+7][00][00][00]

LEGO

[....][00][00][....]

[01][00][00][10]

[00][00][00][00]

[....][00][00][00][....]

[01][00][....][00][10]

[00][00][00][00][00]

[....][00][2k+2][00][....]

[01][00][........][00][10]

[00][00][2k+4][00][00]

[....][00][2k+3][00][....]

[01][00][........][00][10]

[00][00][2k+5][00][00]

LEGO

[....][00][....]

[00][00][00]

[....][00][00][....]

[00][00][00][00]

[....][00][2k+1][00][....]

[00][00][2k+3][00][00]

[....][00][2k+2][00][....]

[00][00][2k+4][00][00]

war-game salvación

for( k = 1 ; k [< ferides-x ; k++ )
{
dau-x[k] = dau-positiu();
Si dau-x[k] < tirada-de-salvació-x+modificador-x ==> vides-x--;
}


for( k = (-1) ; k >] ferides-y ; k-- )
{
dau-y[k] = dau-negatiu();
Si dau-y[k] < tirada-de-salvació-y+modificador-y ==> vides-y--;
}

comprar y teoria de jocs

comprû y no pagû: <n,(-n)>
no comprû y pagû: <(-n),n>
ni comprû ni pagû <(-n),(-n)>
comprû y pagû: <n,n>

condenació y teoria de jocs

atacû y no em condemnû: <(-n),n>
no atacû y em condemnû: <n,(-n)>
atacû y em condemnû: <(-n),(-n)>
ni atacû ni em condemnû: <n,n>


f(n,n) =  n^{2}+2n
f((-n),(-n)) =  n^{2}+(-2)n
f(n,(-n)) =  (-1)n^{2}
f((-n),n) =  (-1)n^{2}

índex de etiquetes

index de etiquetes.

teoria de jocs: poker de 4 cartes

1♣+1♢+1♡+1♠
2♣+2♢+2♡+2♠
3♣+3♢+3♡+3♠
4♣+4♢+4♡+4♠


P(4) = [ 4 // 4 ]·n


2♣+1♢+1♡+1♠
3♣+1♢+1♡+1♠
4♣+1♢+1♡+1♠


1♣+2♢+1♡+1♠
1♣+3♢+1♡+1♠
1♣+4♢+1♡+1♠


1♣+1♢+2♡+1♠
1♣+1♢+3♡+1♠
1♣+1♢+4♡+1♠


1♣+1♢+1♡+2♠
1♣+1♢+1♡+3♠
1♣+1♢+1♡+4♠


P(3,1)= [ 4 // 3 ]·(n+(-1))·n


2♣+2♢+1♡+1♠
3♣+3♢+1♡+1♠
4♣+4♢+1♡+1♠


1♣+1♢+2♡+2♠
1♣+1♢+3♡+3♠
1♣+1♢+4♡+4♠


2♣+1♢+2♡+1♠
3♣+1♢+3♡+1♠
4♣+1♢+4♡+1♠


1♣+2♢+1♡+2♠
1♣+3♢+1♡+3♠
1♣+4♢+1♡+4♠


2♣+1♢+1♡+2♠
3♣+1♢+1♡+3♠
4♣+1♢+1♡+4♠


1♣+2♢+2♡+1♠
1♣+3♢+3♡+1♠
1♣+4♢+4♡+1♠


P(2,2) =  [ 4 // 2 ]·(n+(-1))·n


2♣+1♢+1♡+3♠
2♣+1♢+1♡+4♠
3♣+1♢+1♡+2♠
3♣+1♢+1♡+4♠
4♣+1♢+1♡+2♠
4♣+1♢+1♡+3♠


1♣+2♢+3♡+1♠
1♣+2♢+4♡+1♠
1♣+3♢+2♡+1♠
1♣+3♢+4♡+1♠
1♣+4♢+2♡+1♠
1♣+4♢+3♡+1♠


1♣+1♢+2♡+3♠
1♣+1♢+2♡+4♠
1♣+1♢+3♡+2♠
1♣+1♢+3♡+4♠
1♣+1♢+4♡+2♠
1♣+1♢+4♡+3♠


2♣+3♢+1♡+1♠
2♣+4♢+1♡+1♠
3♣+2♢+1♡+1♠
3♣+4♢+1♡+1♠
4♣+2♢+1♡+1♠
4♣+3♢+1♡+1♠


1♣+2♢+1♡+3♠
1♣+2♢+1♡+4♠
1♣+3♢+1♡+2♠
1♣+3♢+1♡+4♠
1♣+4♢+1♡+2♠
1♣+4♢+1♡+3♠


2♣+1♢+3♡+1♠
2♣+1♢+4♡+1♠
3♣+1♢+2♡+1♠
3♣+1♢+4♡+1♠
4♣+1♢+2♡+1♠
4♣+1♢+3♡+1♠


P(2,1,1) =  [ 4 // 2 ]·( (n+(-2))·(n+(-1)) )·n


Escales:


1♣+2♢+3♡+4♠
4♣+1♢+2♡+3♠
3♣+4♢+1♡+2♠
2♣+3♢+4♡+1♠


2♣+3♢+4♡+5♠
5♣+2♢+3♡+4♠
4♣+5♢+2♡+3♠
3♣+4♢+5♡+2♠


P(1,2,3,4,5) = 4·(n+(-3))


1♣+2♣+3♣+4♣
1♢+2♢+3♢+4♢
1♡+2♡+3♡+4♡
1♠+2♠+3♠+4♠


2♣+3♣+4♣+5♣
2♢+3♢+4♢+5♢
2♡+3♡+4♡+5♡
2♠+3♠+4♠+4♠


P(1,2,3,4,5) = 4·(n+(-3))


1♣+2♣+3♠+4♠
1♠+2♠+3♣+4♣
4♣+1♣+2♠+3♠
4♠+1♠+2♣+3♣


1♢+2♢+3♡+4♡
1♡+2♡+3♢+4♢
4♢+1♢+2♡+3♡
4♡+1♡+2♢+3♢


P(1,2,3,4,5) = 8·(n+(-3))

teoria de jocs: joc cuatre torres

[01,01][02,01][03,01][04,01]
[01,02][02,02][03,02][04,02]
[01,03][02,03][03,03][04,03]
[01,04][02,04][03,04][04,04]


[02,02] = torre_{a}
[02,03] = torre_{a}


[03,02] = torre_{b}
[03,03] = torre_{b}


[01,04] = rey_{a} ( 1 paso )
[04,04] = rey_{b} ( 1 paso )


[01,01] = reina_{a} ( n pasos )
[04,01] = reina_{b} ( n pasos )


algoritme-dual en 3 moviments:
{
reina_{a}[01,01] ==> reina_{b}[04,01]
rey_{b}[04,04] ==> rey_{b}[03,04]
torre_{a}[02,03] ==> torre_{a}[02,04]
escak-mat_{b}
}
{
reina_{b}[04,01] ==> reina_{a}[01,01]
rey_{a}[01,04] ==> rey_{a}[02,04]
torre_{b}[03,03] ==> torre_{b}[03,04]
escak-mat_{a}
}


algoritme-dual en 5 moviments:
{
reina_{a}[01,01] ==> reina_{b}[04,01]
torre_{b}[03,02] ==> torre_{b}[04,02]
reina_{a}[04,01] ==> torre_{b}[04,02]
torre_{b}[03,03] ==> torre_{b}[04,03]
reina_{a}[04,02] ==> torre_{b}[04,03]
escak-mat_{b}
}
{
reina_{b}[04,01] ==> reina_{a}[01,01]
torre_{a}[02,02] ==> torre_{a}[01,02]
reina_{b}[01,01] ==> torre_{a}[01,02]
torre_{a}[02,03] ==> torre_{a}[01,03]
reina_{b}[01,02] ==> torre_{a}[01,03]
escak-mat_{a}
}


algoritme-dual en 8 moviments:
{
torre_{a}[02,02] ==> torre_{b}[03,02]
reina_{b}[04,01] ==> torre_{a}[03,02]
reina_{a}[01,01] ==> reina_{a}[04,01]
rey_{b}[04,04] ==> rey_{b}[03,04]
reina_{a}[04,01] ==> reina_{b}[03,02]
torre_{b}[03,03] ==> reina_{a}[03,02]
torre_{a}[02,03] ==> torre_{a}[02,01]
torre_{b}[03,02] ==> torre_{b}[01,02]
escak-mat_{a}
}
{
torre_{b}[03,02] ==> torre_{a}[02,02]
reina_{a}[01,01] ==> torre_{b}[02,02]
reina_{b}[04,01] ==> reina_{b}[01,01]
rey_{a}[01,04] ==> rey_{a}[02,04]
reina_{b}[01,01] ==> reina_{a}[02,02]
torre_{a}[02,03] ==> reina_{b}[02,02]
torre_{b}[03,03] ==> torre_{b}[03,01]
torre_{a}[02,02] ==> torre_{a}[04,02]
escak-mat_{b}
}

teoria de jocs: joc cuatre-alfil

[01,01][02,01][03,01][04,01]
[01,02][02,02][03,02][04,02]
[01,03][02,03][03,03][04,03]
[01,04][02,04][03,04][04,04]


[02,02] = alfil_{a}
[02,03] = alfil_{a}


[03,02] = alfil_{b}
[03,03] = alfil_{b}


[01,04] = rey_{a}
[04,04] = rey_{b}


[01,01] = reina_{a}
[04,01] = reina_{b}


algoritme-dual de joc:
{
reina_{a}[01,01] ==> reina_{b}[04,01]
alfil_{b}[03,02] ==> reina_{a}[04,01]
alfil_{a}[02,02] ==> alfil_{a}[01,01]
alfil_{b}[03,03] ==> alfil_{a}[01,01]
alfil_{a}[02,03] ==> alfil_{b}[04,01]
}
{
reina_{b}[04,01] ==> reina_{a}[01,01]
alfil_{a}[02,02] ==> reina_{b}[01,01]
alfil_{b}[03,02] ==> alfil_{b}[04,01]
alfil_{a}[02,03] ==> alfil_{b}[04,01]
alfil_{b}[03,03] ==> alfil_{a}[01,01]
}


algoritme-dual:
{
rey_{b}[04,04] ==> rey_{b}[03,03]
alfil_{a}[04,01] ==> alfil_{a}[03,02]
rey_{b}[03,03] ==> alfil_{a}[03,02]
rey_{a}[01,04] ==> rey_{a}[02,04]
alfil_{b}[02,02] ==> alfil_{b}[03,03]
rey_{a}[02,04] ==> rey_{a}[01,04]
rey_{b}[03,02] ==> rey_{b}[02,02]
escak-mat_{a}
}
{
rey_{a}[01,04] ==> rey_{a}[02,03]
alfil_{b}[01,01] ==> alfil_{b}[02,02]
rey_{a}[02,03] ==> alfil_{b}[02,02]
rey_{b}[04,04] ==> rey_{a}[03,04]
alfil_{a}[03,02] ==> alfil_{a}[02,03]
rey_{b}[03,04] ==> rey_{b}[04,04]
rey_{a}[02,03] ==> rey_{a}[03,02]
escak-mat_{b}
}


algoritme-dual:
{
rey_{b}[04,04] ==> rey_{b}[04,03]
rey_{a}[01,04] ==> rey_{a}[02,03]
alfil_{b}[01,01] ==> alfil_{b}[02,02]
rey_{a}[02,03] ==> alfil_{b}[02,02]
rey_{b}[04,03] ==> rey_{b}[04,02]
alfil_{a}[04,01] ==> alfil_{a}[03,02]
escak-mat_{b}
}
{
rey_{a}[01,04] ==> rey_{a}[01,03]
rey_{b}[04,04] ==> rey_{b}[03,03]
alfil_{a}[04,01] ==> alfil_{a}[03,02]
rey_{b}[03,03] ==> alfil_{a}[03,02]
rey_{a}[01,03] ==> rey_{a}[01,02]
alfil_{b}[01,01] ==> alfil_{b}[02,02]
escak-mat_{a}
}

teoria de jocs: corrents de peó

corrents de peó en una pared de totxos.
corrents de peó en un terra de baldosas.
corrents de peó en una pared de azulejos.

teoria de jocs: joc peó 3-2

n=5k:
Si ( a = 1r  &  b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n  &  b = 1r ) ==> ( V=a & F=b )


[a_{0}][00][a_{1}][b_{2}][a_{2}][00][a_{3}][00][00][b_{0}]
[a_{0}][00][a_{1}][b_{2}][a_{2}][00][b_{3}][00][00][b_{0}]


9+((-2)+(-3))+((-2)+(-3))+((-2)+3) = 0
9+((-3)+(-2))+((-3)+(-2))+(3+(-2)) = 0


n=5k+1:
Si ( a = 1r  &  b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n  &  b = 1r ) ==> ( V=a & F=b )


[a_{0}][00][a_{1}][00][a_{2}][00][00][b_{1}][00][00][b_{0}]
[a_{0}][00][a_{1}][00][b_{2}][00][00][b_{1}][00][00][b_{0}]


10+((-2)+(-3))+((-2)+(-3)) = 0
10+((-3)+(-2))+((-3)+(-2)) = 0

teoria de jocs: joc peó 4-1

n=5k:
Si ( a = 1r  &  b = 2n ) ==> ( V=a & F=b )
Si ( a = 2n  &  b = 1r ) ==> ( F=a & V=b )


[a_{0}][b_{2}][a_{2}][00][00][b_{1}][00][00][00][b_{0}]
[a_{0}][a_{1}][00][00][00][b_{1}][00][00][00][b_{0}]


9+((-1)+(-4))+((-1)+(-4))+1 = 0
9+((-4)+(-1))+(-4) = 0


n=5k+1:
Si ( a = 1r  &  b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n  &  b = 1r ) ==> ( V=a & F=b )


[a_{0}][a_{1}][a_{2}][00][00][00][b_{1}][00][00][00][b_{0}]
[a_{0}][a_{1}][b_{2}][00][00][00][b_{1}][00][00][00][b_{0}]


10+((-1)+(-4))+((-1)+(-4)) = 0
10+((-4)+(-1))+((-4)+(-1)) = 0


n=5k+2:
Si ( a = 1r  &  b = 2n ) ==> ( V=a & F=b )
Si ( a = 2n  &  b = 1r ) ==> ( F=a & V=b )


[a_{0}][a_{1}][a_{2}][b_{2}][00][00][00][b_{1}][00][00][00][b_{0}]
[a_{0}][a_{1}][a_{2}][a_{3}][00][00][00][b_{3}][00][00][00][b_{0}]


11+((-1)+(-4))+((-1)+(-4))+(-1) = 0
11+((-4)+(-1))+((-4)+(-1))+(4+(-1))+(-4) = 0


n=5k+3:
Si ( a = 1r  &  b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n  &  b = 1r ) ==> ( V=a & F=b )


[a_{0}][a_{1}][a_{2}][a_{3}][a_{4}][00][00][00][b_{3}][00][00][00][b_{0}]
[a_{0}][a_{1}][a_{2}][a_{3}][b_{4}][00][00][00][b_{3}][00][00][00][b_{0}]


12+((-1)+(-4))+((-1)+(-4))+((-1)+4)+((-1)+(-4)) = 0
12+((-4)+(-1))+((-4)+(-1))+(4+(-1))+((-4)+(-1)) = 0


n=5k+4:
Si ( a = 1r  &  b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n  &  b = 1r ) ==> ( V=a & F=b )


[a_{0}][a_{3}][a_{2}][00][00][b_{2}][00][00][00][b_{1}][00][00][00][b_{0}]
[a_{0}][b_{3}][a_{2}][00][00][b_{2}][00][00][00][b_{1}][00][00][00][b_{0}]


13+((-1)+(-4))+((-1)+(-4))+(1+(-4)) = 0
13+((-4)+(-1))+((-4)+(-1))+((-4)+1) = 0

teoria de jocs: joc peó 3-1

n=4k:
Si ( a = 1r  &  b = 2n ) ==> ( V=a & F=b )
Si ( a = 2n  &  b = 1r ) ==> ( F=a & V=b )


[a_{0}][b_{2}][a_{2}][00][b_{1}][00][00][b_{0}]
[a_{0}][a_{1}][00][00][b_{1}][00][00][b_{0}]


7+((-1)+(-3))+((-1)+(-3))+1 = 0
7+((-3)+(-1))+(-3) = 0


n=4k+1:
Si ( a = 1r  &  b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n  &  b = 1r ) ==> ( V=a & F=b )


[a_{0}][a_{1}][a_{2}][00][00][b_{1}][00][00][b_{0}]
[a_{0}][a_{1}][b_{2}][00][00][b_{1}][00][00][b_{0}]


8+((-1)+(-3))+((-1)+(-3)) = 0
8+((-3)+(-1))+((-3)+(-1)) = 0


n=4k+2
Si ( a = 1r  &  b = 2n ) ==> ( V=a & F=b )
Si ( a = 2n  &  b = 1r ) ==> ( F=a & V=b )


[a_{0}][a_{1}][a_{2}][b_{2}][00][00][b_{1}][00][00][b_{0}]
[b_{3}][a_{1}][a_{2}][b_{2}][00][00][b_{1}][00][00][b_{0}]


9+((-1)+(-3))+((-1)+(-3))+(-1) = 0
9+((-3)+(-1))+((-3)+(-1))+((-3)+(-1))+3 = 0


n=4k+3:
Si ( a = 1r  &  b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n  &  b = 1r ) ==> ( V=a & F=b )


[a_{0}][b_{3}][a_{2}][a_{3}][b_{2}][00][00][b_{1}][00][00][b_{0}]
[a_{0}][b_{3}][a_{2}][00][b_{2}][00][00][b_{1}][00][00][b_{0}]


10+((-1)+(-3))+((-1)+(-3))+((-1)+(-3))+((-1)+3) = 0
10+((-3)+(-1))+((-3)+(-1))+((-3)+1) = 0

teoria de jocs: joc peó 2-1

n=3k:
Si ( a = 1r  &  b = 2n ) ==> ( V=a & F=b )
Si ( a = 2n  &  b = 1r ) ==> ( F=a & V=b )


[a_{0}][b_{2}][a_{2}][b_{1}][00][b_{0}]
[a_{0}][a_{1}][00][b_{1}][00][b_{0}]


5+((-1)+(-2))+((-1)+(-2))+1 = 0
5+((-2)+(-1))+(-2) = 0


n=3k+1:
Si ( a = 1r & b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n & b = 1r ) ==> ( V=a & F=b )


[a_{0}][a_{1}][a_{2}][00][b_{1}][00][b_{0}]
[a_{0}][a_{1}][b_{2}][00][b_{1}][00][b_{0}]


6+((-1)+(-2))+((-1)+(-2)) = 0
6+((-2)+(-1))+((-2)+(-1)) = 0


n=3k+2:
Si ( a = 1r & b = 2n ) ==> ( V=a & F=b )
Si ( a = 2n & b = 1r ) ==> ( F=a & V=b )


[a_{0}][a_{1}][a_{2}][b_{2}][00][b_{1}][00][b_{0}]
[a_{0}][b_{3}][a_{2}][a_{3}][00][b_{1}][00][b_{0}]


7+((-1)+(-2))+((-1)+(-2))+(-1) = 0
7+((-2)+(-1))+((-2)+(-1))+((-2)+(-1))+2 = 0

teoria de jocs: joc peó 1-1

n=2k:
Si ( a = 1r  &  b = 2n ) ==> ( V=a & F=b )
Si ( a = 2n  &  b = 1r ) ==> ( F=a & V=b )


[a_{0}][a_{1}][a_{2}][b_{2}][b_{1}][b_{0}]


5+((-1)+(-1))+((-1)+(-1))+(-1) = 0


n=2k+1:
Si ( a = 1r  &  b = 2n ) ==> ( F=a & V=b )
Si ( a = 2n  &  b = 1r ) ==> ( V=a & F=b )


[a_{0}][a_{1}][a_{2}][b_{1}][b_{0}]
[a_{0}][a_{1}][b_{2}][b_{1}][b_{0}]


4+((-1)+(-1))+((-1)+(-1)) = 0

war-game

tirada-para-impactar-positiu <==> braç dret.
tirada-para-impactar-negatiu <==> braç esquerra.


int tirada-para-impactar-x( int tirada-para-impactar-x-positiu , int tirada-para-impactar-x-negatiu ,...
... int trets-x )
{
impactes-en-y=0;


si poder-de-carta-x == 1 ==>
{
carta-x=jugar-carta-x(cartes-x[i],cartes-jugables-x[j]);
si carta-x == 0 ==> poder-de-carta-x=1;
si carta-x != 0 ==> poder-de-carta-x=0;
}
si poder-de-carta-y == (-1) ==>
{
carta-y=jugar-carta-y(cartes-y[i],cartes-jugables-y[j]);
si carta-y == not(0) ==> poder-de-carta-y=(-1);
si carta-y != not(0) ==> poder-de-carta-y=not(0);
}


si carta-x == 1 ==>
{
tirada-para-impactar-x-positiu--;
tirada-para-impactar-x-negatiu++;
}
si carta-y == (-1) ==>
{
tirada-para-impactar-x-positiu++;
tirada-para-impactar-x-negatiu--;
}
si carta-x == 2 ==>
{
tirada-para-impactar-x-positiu--;
tirada-para-impactar-x-positiu--;
si tirada-para-impactar-positiu [< 2 ==> tirada-para-impactar-positiu=2;
tirada-para-impactar-x-negatiu++;
tirada-para-impactar-x-negatiu++;
si tirada-para-impactar-negatiu >] (-2) ==> tirada-para-impactar-negatiu=(-2);
}
si carta-y == (-2) ==>
{
tirada-para-impactar-x-positiu++;
tirada-para-impactar-x-positiu++;
si tirada-para-impactar-positiu >] 6 ==> tirada-para-impactar-positiu=6;
tirada-para-impactar-x-negatiu--;
tirada-para-impactar-x-negatiu--;
si tirada-para-impactar-negatiu [< (-6) ==> tirada-para-impactar-negatiu=(-6);
}
si carta-x == 3 ==>
{
tirada-para-impactar-x-positiu--;
tirada-para-impactar-x-positiu--;
tirada-para-impactar-x-positiu--;
si tirada-para-impactar-positiu [< 2 ==> tirada-para-impactar-positiu=2;
tirada-para-impactar-x-negatiu++;
tirada-para-impactar-x-negatiu++;
tirada-para-impactar-x-negatiu++;
si tirada-para-impactar-negatiu >] (-2) ==> tirada-para-impactar-negatiu=(-2);
}
si carta-y == (-3) ==>
{
tirada-para-impactar-x-positiu++;
tirada-para-impactar-x-positiu++;
tirada-para-impactar-x-positiu++;
si tirada-para-impactar-positiu >] 6 ==> tirada-para-impactar-positiu=6;
tirada-para-impactar-x-negatiu--;
tirada-para-impactar-x-negatiu--;
tirada-para-impactar-x-negatiu--;
si tirada-para-impactar-negatiu [< (-6) ==> tirada-para-impactar-negatiu=(-6);
}


si tirada-para-impactar-positiu != 0 ==>
{
dau-fantasma-x=min(1,6);
dau-fantasma-y=max(1,6);
for( k=1 ; k [< trets-x ; k++ )
{
dau[k] = tirada-de-dau-positiu();
si carta-x == 4 & carta-y != (-4) ==>
{
si max( dau-fantasma-x , dau[k] ) >] tirada-para-impactar-x-positiu ==> impactes-en-y++;
}
si carta-x != 4 & carta-y == (-4) ==>
{
si min( dau-fantasma-y , dau[k] ) >] tirada-para-impactar-x-positiu ==> impactes-en-y++;
}
dau-fantasma-x=max( dau-fantasma-x , dau[k] );
dau-fantasma-y=min( dau-fantasma-y , dau[k] );


si carta-x != 4 & carta-y != (-4) ==>
{
si dau[k] >] tirada-para-impactar-x-positiu ==> impactes-en-y++;
}
si carta-x == 4 & carta-y == (-4) ==>
{
si dau[k] >] tirada-para-impactar-x-positiu ==> impactes-en-y++;
}
}
}


si tirada-para-impactar-negatiu != not(0) ==>
{
dau-fantasma-x=max((-1),(-6));
dau-fantasma-y=min((-1),(-6));
for( k=(-1) ; k [< not(trets-x) ; k-- )
{
dau[k] = tirada-de-dau-negatiu();
si carta-x == 4 & carta-y != (-4) ==>
{
si min( dau-fantasma-x , dau[k] ) [< tirada-para-impactar-x-negatiu ==> impactes-en-y++;
}
si carta-x != 4 & carta-y == (-4) ==>
{
si max( dau-fantasma-y , dau[k] ) [< tirada-para-impactar-x-negatiu ==> impactes-en-y++;
}
dau-fantasma-x=min( dau-fantasma-x , dau[k] );
dau-fantasma-y=max( dau-fantasma-y , dau[k] );


si carta-x != 4 & carta-y != (-4) ==>
{
si dau[k] [< tirada-para-impactar-x-negatiu ==> impactes-en-y++;
}
si carta-x == 4 & carta-y == (-4) ==>
{
si dau[k] [< tirada-para-impactar-x-negatiu ==> impactes-en-y++;
}
}
}


return(impactes-en-y);
}