954,500 Members — Technology Publication meets Social Media
Username:
Password:
Lost login information?
Have something to say? Contribute New Article Reply to this Article

chess problem

Dear

I am working on project to build a win 32 app that counts how many bishops on n x n board can be placed without attacking each other. Does someone worked on classes similar that I need ,or someone worked on similar console problem? Because the algorytm uses backtracking and I have first contact with object oriented programming .Anything posted helps ,thx in advance and sorry for my bad English.

wizard_x
Newbie Poster
1 post since Aug 2011
Reputation Points: 10
Solved Threads: 0
 

Hi wizard_x, welcome here :)
I guess my Enlish is as good as yours!
Your problem has not that much to do with OO, just read a good book on C# to get you on the way. Also, as documentation, have a look at this: http://en.wikipedia.org/wiki/Mathematical_chess_problem

ddanbe
Senior Poster
3,829 posts since Oct 2008
Reputation Points: 2,070
Solved Threads: 661
 

This article has been dead for over three months

Post: Markdown Syntax: Formatting Help
You
View similar articles that have also been tagged: