Netlogo coding - N-queen problem with depth first search (maybe with recursive)
€8-30 EUR
Pagado a la entrega
Hello fellas, i've been searching people who knows how to code in this netlogo thingy. I am searching for someone who would like to code one thing. The point is i need N-queen problem (you have to put queens on chessboard as much as you can but they cant threat each other) but with Depth-first-search method used. I am a desperate student who is searching for someone everywhere. If you know how to do that please contact me and we can make a deal. Thanks <3 (stack dumped me hope u will not)
You can use my already coded nqueen with modular chessboard but i need DFS to be implemented in it.
Nº del proyecto: #13683675
Sobre el proyecto
3 freelancers están ofertando un promedio de €71 por este trabajo
How long will it take you to finish the job? i shall finish it in a week Proposal: i am familiar with NetLogo and i used it before in agent based programming for swarm simulation. contact me if you are interested
