Originally Posted by muted
That looks about right.Code:void dump( char b[] ) { size_t row,col; for( row = 0; row < 8; row++ ) for( col = 0; col < 8; col++ ) { putchar( b[ (row * 8) + col ] ); if( col == 7 ) putchar( '\n' ); } }
Quzah.
That looks about right.Code:void dump( char b[] ) { size_t row,col; for( row = 0; row < 8; row++ ) for( col = 0; col < 8; col++ ) { putchar( b[ (row * 8) + col ] ); if( col == 7 ) putchar( '\n' ); } }
Quzah.
Hope is the first step on the road to disappointment.
Is it like the 8 queens problem, only applied to knights?
Eight queens puzzle - Wikipedia, the free encyclopedia
Or maybe it's the knight's tour?
Knight's tour - Wikipedia, the free encyclopedia
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
do you know how to make my map correctly. ?
I just showed you how. How wide is a chess board? 8 spaces. You have one long array, so every eight spaces, print a newline to the screen, before continuing to draw the contents of the board from your array.
Quzah.
Hope is the first step on the road to disappointment.
No problem with the queens that they arrange so that they do not beat each other! and knight tour is also not suitable
is to tasks on the chess board to withdraw the minimum number of knights so that every cell in the field was under attack knight
you can write code, I did not quite understand you
What part don't you understand? I put it into words and into code. See that pair of loops up at the top of the page?
Quzah.
Hope is the first step on the road to disappointment.
