Member Avatar for wizard_x

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.

Edited by wizard_x because: n/a
  • 2 Contributors
  • 1 Reply
  • 119 Views
  • 6 Hours Discussion Span
  • Latest Post Latest Post by ddanbe
Member Avatar for ddanbe

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

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.