Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

Go Language

Swathi Kasoju
PLUS
Swathi Kasoju
Courses Plus Student 8,458 Points

please let me know how to write recursive loop through to find the best move for given pawns, queens of infinite board

I am trying to solve on code which has an infinite board and with pawns and queens with the main Queen final turn, so need to find all the possible moves and get the best move which gives the highest score on the board. Can anyone help me with the logic or any possibility to run recursive loops on a two-dimensional string slice?

Google is a wonderful resource https://www.dotnetperls.com/2d-go