ramirez
20 de Enero del 2006

por favor como hago para llevar el valor de X, Y desde el metodo TORN1MouseMove al siguiente metodo
gracias
void __fastcall TForm1::TORN1MouseMove(TObject *Sender, TShiftState Shift,
int X, int Y)
{
if( capto == true )
{
TImage * theTORN1 = (TImage *) Sender;
int newX, newY;

if ( oldX < X )
{
newX = X - oldX;
theTORN1->Left = theTORN1->Left + newX;
}
else if ( X < oldX )
{
newX = oldX - X;
theTORN1->Left = theTORN1->Left - newX;
}

if ( oldY < Y )
{
newY = Y - oldY;
theTORN1->Top = theTORN1->Top + newY;
}
else if ( Y < oldY )
{
newY = oldY - Y;
theTORN1->Top = theTORN1->Top - newY;
}
X=X;
Y=Y;
}
}


void __fastcall TForm1::TORN1DblClick(TObject *Sender)
{
if((oldX > Y-10 && oldX < Y+10) || (oldY > X-10 && oldY < X+10))
{
postn1 = true;
}
else
{
postn1 = false;
}
if(TORN1->Top > Shape1->Top - 12 && TORN1->Top < Shape1->Top + 12
&& TORN1->Left > Shape1->Left - 12 && TORN1->Left < Shape1->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape1->Top;
TORN1->Left = Shape1->Left;
}
if(TORN1->Top > Shape2->Top - 12 && TORN1->Top < Shape2->Top + 12
&& TORN1->Left > Shape2->Left - 12 && TORN1->Left < Shape2->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape2->Top;
TORN1->Left = Shape2->Left;
}
if(TORN1->Top > Shape3->Top - 12 && TORN1->Top < Shape3->Top + 12
&& TORN1->Left > Shape3->Left - 12 && TORN1->Left < Shape3->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape3->Top;
TORN1->Left = Shape3->Left;
}
if(TORN1->Top > Shape4->Top - 12 && TORN1->Top < Shape4->Top + 12
&& TORN1->Left > Shape4->Left - 12 && TORN1->Left < Shape4->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape4->Top;
TORN1->Left = Shape4->Left;
}
if(TORN1->Top > Shape5->Top - 12 && TORN1->Top < Shape5->Top + 12
&& TORN1->Left > Shape5->Left - 12 && TORN1->Left < Shape5->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape5->Top;
TORN1->Left = Shape5->Left;
}
if(TORN1->Top > Shape6->Top - 12 && TORN1->Top < Shape6->Top + 12
&& TORN1->Left > Shape6->Left - 12 && TORN1->Left < Shape6->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape6->Top;
TORN1->Left = Shape6->Left;
}
if(TORN1->Top > Shape7->Top - 12 && TORN1->Top < Shape7->Top + 12
&& TORN1->Left > Shape7->Left - 12 && TORN1->Left < Shape7->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape7->Top;
TORN1->Left = Shape7->Left;
}
if(TORN1->Top > Shape8->Top - 12 && TORN1->Top < Shape8->Top + 12
&& TORN1->Left > Shape8->Left - 12 && TORN1->Left < Shape8->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape8->Top;
TORN1->Left = Shape8->Left;
}
if(TORN1->Top > Shape9->Top - 12 && TORN1->Top < Shape9->Top + 12
&& TORN1->Left > Shape9->Left - 12 && TORN1->Left < Shape9->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape9->Top;
TORN1->Left = Shape9->Left;
}
if(TORN1->Top > Shape10->Top - 12 && TORN1->Top < Shape10->Top + 12
&& TORN1->Left > Shape10->Left - 12 && TORN1->Left < Shape10->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape10->Top;
TORN1->Left = Shape10->Left;
}

if(TORN1->Top > Shape11->Top - 12 && TORN1->Top < Shape11->Top + 12
&& TORN1->Left > Shape11->Left - 12 && TORN1->Left < Shape11->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape11->Top;
TORN1->Left = Shape11->Left;
}
if(TORN1->Top > Shape12->Top - 12 && TORN1->Top < Shape12->Top + 12
&& TORN1->Left > Shape12->Left - 12 && TORN1->Left < Shape12->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape12->Top;
TORN1->Left = Shape12->Left;
}
if(TORN1->Top > Shape13->Top - 12 && TORN1->Top < Shape13->Top + 12
&& TORN1->Left > Shape13->Left - 12 && TORN1->Left < Shape13->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape13->Top;
TORN1->Left = Shape13->Left;
}
if(TORN1->Top > Shape14->Top - 12 && TORN1->Top < Shape14->Top + 12
&& TORN1->Left > Shape14->Left - 12 && TORN1->Left < Shape14->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape14->Top;
TORN1->Left = Shape14->Left;
}
if(TORN1->Top > Shape15->Top - 12 && TORN1->Top < Shape15->Top + 12
&& TORN1->Left > Shape15->Left - 12 && TORN1->Left < Shape15->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape15->Top;
TORN1->Left = Shape15->Left;
}
if(TORN1->Top > Shape16->Top - 12 && TORN1->Top < Shape16->Top + 12
&& TORN1->Left > Shape16->Left - 12 && TORN1->Left < Shape16->Left + 12
&& postn1 == true)
{
capto = false;
TORN1->Top = Shape16->Top;
TORN1->Left = Shape16->Left;
}
if(TORN1->Top > Shape17->Top - 12 && TORN1->Top < Shape17->Top + 12
&& TORN1->Left > Shape17->Left - 12 && TORN1->Left < Shape17->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape17->Top;
TORN1->Left = Shape17->Left;
}
if(TORN1->Top > Shape18->Top - 12 && TORN1->Top < Shape18->Top + 12
&& TORN1->Left > Shape18->Left - 12 && TORN1->Left < Shape18->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape18->Top;
TORN1->Left = Shape18->Left;
}
if(TORN1->Top > Shape19->Top - 12 && TORN1->Top < Shape19->Top + 12
&& TORN1->Left > Shape19->Left - 12 && TORN1->Left < Shape19->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape19->Top;
TORN1->Left = Shape19->Left;
}
if(TORN1->Top > Shape20->Top - 12 && TORN1->Top < Shape20->Top + 12
&& TORN1->Left > Shape20->Left - 12 && TORN1->Left < Shape20->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape20->Top;
TORN1->Left = Shape20->Left;
}
if(TORN1->Top > Shape21->Top - 12 && TORN1->Top < Shape21->Top + 12
&& TORN1->Left > Shape21->Left - 12 && TORN1->Left < Shape21->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape21->Top;
TORN1->Left = Shape21->Left;
}
if(TORN1->Top > Shape22->Top - 12 && TORN1->Top < Shape22->Top + 12
&& TORN1->Left > Shape22->Left - 12 && TORN1->Left < Shape22->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape22->Top;
TORN1->Left = Shape22->Left;
}
if(TORN1->Top > Shape23->Top - 12 && TORN1->Top < Shape23->Top + 12
&& TORN1->Left > Shape23->Left - 12 && TORN1->Left < Shape23->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape23->Top;
TORN1->Left = Shape23->Left;
}
if(TORN1->Top > Shape24->Top - 12 && TORN1->Top < Shape24->Top + 12
&& TORN1->Left > Shape24->Left - 12 && TORN1->Left < Shape24->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape24->Top;
TORN1->Left = Shape24->Left;
}
if(TORN1->Top > Shape25->Top - 12 && TORN1->Top < Shape25->Top + 12
&& TORN1->Left > Shape25->Left - 12 && TORN1->Left < Shape25->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape25->Top;
TORN1->Left = Shape25->Left;
}
if(TORN1->Top > Shape26->Top - 12 && TORN1->Top < Shape26->Top + 12
&& TORN1->Left > Shape26->Left - 12 && TORN1->Left < Shape26->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape26->Top;
TORN1->Left = Shape26->Left;
}
if(TORN1->Top > Shape27->Top - 12 && TORN1->Top < Shape27->Top + 12
&& TORN1->Left > Shape27->Left - 12 && TORN1->Left < Shape27->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape27->Top;
TORN1->Left = Shape27->Left;
}
if(TORN1->Top > Shape28->Top - 12 && TORN1->Top < Shape28->Top + 12
&& TORN1->Left > Shape28->Left - 12 && TORN1->Left < Shape28->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape28->Top;
TORN1->Left = Shape28->Left;
}
if(TORN1->Top > Shape29->Top - 12 && TORN1->Top < Shape29->Top + 12
&& TORN1->Left > Shape29->Left - 12 && TORN1->Left < Shape29->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape29->Top;
TORN1->Left = Shape29->Left;
}

if(TORN1->Top > Shape30->Top - 12 && TORN1->Top < Shape30->Top + 12
&& TORN1->Left > Shape30->Left - 12 && TORN1->Left < Shape30->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape30->Top;
TORN1->Left = Shape30->Left;
}
if(TORN1->Top > Shape31->Top - 12 && TORN1->Top < Shape31->Top + 12
&& TORN1->Left > Shape31->Left - 12 && TORN1->Left < Shape31->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape31->Top;
TORN1->Left = Shape31->Left;
}
if(TORN1->Top > Shape32->Top - 12 && TORN1->Top < Shape32->Top + 12
&& TORN1->Left > Shape32->Left - 12 && TORN1->Left < Shape32->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape32->Top;
TORN1->Left = Shape32->Left;
}

if(TORN1->Top > Shape33->Top - 12 && TORN1->Top < Shape33->Top + 12
&& TORN1->Left > Shape33->Left - 12 && TORN1->Left < Shape33->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape33->Top;
TORN1->Left = Shape33->Left;
}

if(TORN1->Top > Shape34->Top - 12 && TORN1->Top < Shape34->Top + 12
&& TORN1->Left > Shape34->Left - 12 && TORN1->Left < Shape34->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape34->Top;
TORN1->Left = Shape34->Left;
}

if(TORN1->Top > Shape35->Top - 12 && TORN1->Top < Shape35->Top + 12
&& TORN1->Left > Shape35->Left - 12 && TORN1->Left < Shape35->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape35->Top;
TORN1->Left = Shape35->Left;
}

if(TORN1->Top > Shape36->Top - 12 && TORN1->Top < Shape36->Top + 12
&& TORN1->Left > Shape36->Left - 12 && TORN1->Left < Shape36->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape36->Top;
TORN1->Left = Shape36->Left;
}

if(TORN1->Top > Shape37->Top - 12 && TORN1->Top < Shape37->Top + 12
&& TORN1->Left > Shape37->Left - 12 && TORN1->Left < Shape37->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape37->Top;
TORN1->Left = Shape37->Left;
}

if(TORN1->Top > Shape38->Top - 12 && TORN1->Top < Shape38->Top + 12
&& TORN1->Left > Shape38->Left - 12 && TORN1->Left < Shape38->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape38->Top;
TORN1->Left = Shape38->Left;
}

if(TORN1->Top > Shape39->Top - 12 && TORN1->Top < Shape39->Top + 12
&& TORN1->Left > Shape39->Left - 12 && TORN1->Left < Shape39->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape39->Top;
TORN1->Left = Shape39->Left;
}

if(TORN1->Top > Shape40->Top - 12 && TORN1->Top < Shape40->Top + 12
&& TORN1->Left > Shape40->Left - 12 && TORN1->Left < Shape40->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape40->Top;
TORN1->Left = Shape40->Left;
}

if(TORN1->Top > Shape41->Top - 12 && TORN1->Top < Shape41->Top + 12
&& TORN1->Left > Shape41->Left - 12 && TORN1->Left < Shape41->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape41->Top;
TORN1->Left = Shape41->Left;
}

if(TORN1->Top > Shape42->Top - 12 && TORN1->Top < Shape42->Top + 12
&& TORN1->Left > Shape42->Left - 12 && TORN1->Left < Shape42->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape42->Top;
TORN1->Left = Shape42->Left;
}

if(TORN1->Top > Shape43->Top - 12 && TORN1->Top < Shape43->Top + 12
&& TORN1->Left > Shape43->Left - 12 && TORN1->Left < Shape43->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape43->Top;
TORN1->Left = Shape43->Left;
}

if(TORN1->Top > Shape44->Top - 12 && TORN1->Top < Shape44->Top + 12
&& TORN1->Left > Shape44->Left - 12 && TORN1->Left < Shape44->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape44->Top;
TORN1->Left = Shape44->Left;
}

if(TORN1->Top > Shape45->Top - 12 && TORN1->Top < Shape45->Top + 12
&& TORN1->Left > Shape45->Left - 12 && TORN1->Left < Shape45->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape45->Top;
TORN1->Left = Shape45->Left;
}

if(TORN1->Top > Shape46->Top - 12 && TORN1->Top < Shape46->Top + 12
&& TORN1->Left > Shape46->Left - 12 && TORN1->Left < Shape46->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape46->Top;
TORN1->Left = Shape46->Left;
}

if(TORN1->Top > Shape47->Top - 12 && TORN1->Top < Shape47->Top + 12
&& TORN1->Left > Shape47->Left - 12 && TORN1->Left < Shape47->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape47->Top;
TORN1->Left = Shape47->Left;
}

if(TORN1->Top > Shape48->Top - 12 && TORN1->Top < Shape48->Top + 12
&& TORN1->Left > Shape48->Left - 12 && TORN1->Left < Shape48->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape48->Top;
TORN1->Left = Shape48->Left;
}

if(TORN1->Top > Shape49->Top - 12 && TORN1->Top < Shape49->Top + 12
&& TORN1->Left > Shape49->Left - 12 && TORN1->Left < Shape49->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape49->Top;
TORN1->Left = Shape49->Left;
}

if(TORN1->Top > Shape50->Top - 12 && TORN1->Top < Shape50->Top + 12
&& TORN1->Left > Shape50->Left - 12 && TORN1->Left < Shape50->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape50->Top;
TORN1->Left = Shape50->Left;
}

if(TORN1->Top > Shape51->Top - 12 && TORN1->Top < Shape51->Top + 12
&& TORN1->Left > Shape51->Left - 12 && TORN1->Left < Shape51->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape51->Top;
TORN1->Left = Shape51->Left;
}

if(TORN1->Top > Shape52->Top - 12 && TORN1->Top < Shape52->Top + 12
&& TORN1->Left > Shape52->Left - 12 && TORN1->Left < Shape52->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape52->Top;
TORN1->Left = Shape52->Left;
}

if(TORN1->Top > Shape53->Top - 12 && TORN1->Top < Shape53->Top + 12
&& TORN1->Left > Shape53->Left - 12 && TORN1->Left < Shape53->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape53->Top;
TORN1->Left = Shape53->Left;
}

if(TORN1->Top > Shape54->Top - 12 && TORN1->Top < Shape54->Top + 12
&& TORN1->Left > Shape54->Left - 12 && TORN1->Left < Shape54->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape54->Top;
TORN1->Left = Shape54->Left;
}

if(TORN1->Top > Shape55->Top - 12 && TORN1->Top < Shape55->Top + 12
&& TORN1->Left > Shape55->Left - 12 && TORN1->Left < Shape55->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape55->Top;
TORN1->Left = Shape55->Left;
}

if(TORN1->Top > Shape56->Top - 12 && TORN1->Top < Shape56->Top + 12
&& TORN1->Left > Shape56->Left - 12 && TORN1->Left < Shape56->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape56->Top;
TORN1->Left = Shape56->Left;
}

if(TORN1->Top > Shape57->Top - 12 && TORN1->Top < Shape57->Top + 12
&& TORN1->Left > Shape57->Left - 12 && TORN1->Left < Shape57->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape57->Top;
TORN1->Left = Shape57->Left;
}

if(TORN1->Top > Shape58->Top - 12 && TORN1->Top < Shape58->Top + 12
&& TORN1->Left > Shape58->Left - 12 && TORN1->Left < Shape58->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape58->Top;
TORN1->Left = Shape58->Left;
}

if(TORN1->Top > Shape59->Top - 12 && TORN1->Top < Shape59->Top + 12
&& TORN1->Left > Shape59->Left - 12 && TORN1->Left < Shape59->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape59->Top;
TORN1->Left = Shape59->Left;
}

if(TORN1->Top > Shape60->Top - 12 && TORN1->Top < Shape60->Top + 12
&& TORN1->Left > Shape60->Left - 12 && TORN1->Left < Shape60->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape60->Top;
TORN1->Left = Shape60->Left;
}

if(TORN1->Top > Shape61->Top - 12 && TORN1->Top < Shape61->Top + 12
&& TORN1->Left > Shape61->Left - 12 && TORN1->Left < Shape61->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape61->Top;
TORN1->Left = Shape61->Left;
}

if(TORN1->Top > Shape62->Top - 12 && TORN1->Top < Shape62->Top + 12
&& TORN1->Left > Shape62->Left - 12 && TORN1->Left < Shape62->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape62->Top;
TORN1->Left = Shape62->Left;
}

if(TORN1->Top > Shape63->Top - 12 && TORN1->Top < Shape63->Top + 12
&& TORN1->Left > Shape63->Left - 12 && TORN1->Left < Shape63->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape63->Top;
TORN1->Left = Shape63->Left;
}

if(TORN1->Top > Shape64->Top - 12 && TORN1->Top < Shape64->Top + 12
&& TORN1->Left > Shape64->Left - 12 && TORN1->Left < Shape64->Left + 12 && postn1 == true)
{
capto = false;
TORN1->Top = Shape64->Top;
TORN1->Left = Shape64->Left;
}

if((TORN1->Top == TORN2->Top && TORN1->Left == TORN2->Left
|| TORN1->Top == CABN1->Top && TORN1->Left == CABN1->Left
|| TORN1->Top == CANB2->Top && TORN1->Left == CANB2->Left
|| TORN1->Top == ALFN1->Top && TORN1->Left == ALFN1->Left
|| TORN1->Top == ALFN2->Top && TORN1->Left == ALFN2->Left
|| TORN1->Top == REYNANE->Top && TORN1->Left == REYNANE->Left
|| TORN1->Top == REYNE->Top && TORN1->Left == REYNE->Left
|| diagonal == true) && capto == false)
{
capto = true;
ShowMessage(\"Esa jugada no está permitida\");
}
}