％BIQPBOX Bisection reflective line search for sqpbox
％ [nx,nsig,alpha] = BIQPBOX(s,c,strg,x,y,sigma,l,u,...
％ oval,po,normg,DS,mtxmpy,data,H)
％ returns the new feasible point nx, the corresponding sign vector nsig,
％ and the step size of the unreflected step, alpha.
％ Copyright (c) 1990-98 by The MathWorks, Inc.
％ $Revision: 1.2 $ $Date:
標簽：
BIQPBOX
reflective
Bisection
search
上傳時間：
2013-12-17
上傳用戶：sk5201314
void Knight(int i , int j)
{
// printf("％d ％dn",i,j)
if (board[i][j] != 0 || i < 0 || i >= Size || j < 0 || j >= Size )
{
return
}
step++
board[i][j]=step
if (step == Size*Size)
{
showboard()
system("PAUSE")
return
}
//DFS
Knight(i-2,j-1) //left
Knight(i-2,j+1)
Knight(i+2,j-1) //right
Knight(i+2,j+1)
Knight(i-1,j-2) //up
Knight(i+1,j-2)
Knight(i+1,j+2) //down
Knight(i-1,j+2)
//
board[i][j]=0
step--
}
標簽：
int
Knight
printf
board
上傳時間：
2014-01-17
上傳用戶：cxl274287265
