I am a student in an university...
I am assigned a project about the knight's tour on the chess , but must use the Warnsdorff's rule ...
rule : Put a knight on the chess with any square , and find all patchs of knight (knight pass each square only once time )..
Who can help me???
All 4 RepliesReply to this topic
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.