Re: How to Determine a Column Conflict in Python
No problem, and as you'd guessed changing lines like "while (x > 0) and (y < 7):" to "while (x > 0) and (y < len(board)-1):" would work fine for arbitrary grid sizes.
URL: http://forum.audiogames.net/viewtopic.php?pid=255029#p255029
Re: How to Determine a Column Conflict in Python
Eurika! Thanks much, @magurp244. I now have a working solution.
URL: http://forum.audiogames.net/viewtopic.php?pid=255027#p255027
___
Audiogames-reflector mailing list
Re: How to Determine a Column Conflict in Python
I wonder if I can take your implementation of the eight queens and adjust it to fit an arbitrary m by n board?It looks like we're doing length(board)-1 for diagonal cases. Is this just an observation for this particular case, or would this
Re: How to Determine a Column Conflict in Python
Just find the coordinates of the point and the queen. Find the difference in coordinates (say, dy for p2.y-p1.y) and the same for dx.Now you're subtracting one set from another, so you're essentially finding the location of the second queen
Re: How to Determine a Column Conflict in Python
Just find the coordinates of the point and the queen. Find the difference in coordinates (say, dy for p2.y-p1.y) and the same for dx.Now you're subtracting one set from another, so you're essentially finding the location of the second queen
Re: How to Determine a Column Conflict in Python
Hm, so am I to assume that [(0,0),(0,1)] is a set of coordinates for 0,0, and 0,1, on the grid? Are you looking for the distance between the given position and queens? Given your example, what would the output your looking for look like?
Re: How to Determine a Column Conflict in Python
Hmm. I think I confuse you a bit, my apoligies.The board is of arbritrary length, and we want a location of queens relative to the given location.diagonal_conflict([[True, True], [False, False]], 0, 1)My coords function would take this input
Re: How to Determine a Column Conflict in Python
I think this might work:#build 8x8 chess board grid
board = []
for a in xrange(0,8,1):
board.append([])
for b in xrange(0,8,1):
board[a].append(0)
#set position of a queen
board[1][3] = 1
#diagonal queen finder
def
Re: How to Determine a Column Conflict in Python
The object is to see if a queen occupies a diagonal that is in line with the specified (row, column) parameter. The queens are booleans, True means there is a queen, False means there is not a queen.
URL:
Re: How to Determine a Column Conflict in Python
Could you be more specific? Do you mean a board of queens as in a Chess Board? What constitutes a conflict? Is it to determine if an object is along a given path? Or to see if two objects intersect?
URL:
10 matches
Mail list logo
