anthonyberet wrote:
> I want to work on a sudoku brute-forcer, just for fun.
>...
> Thanks for the advice (to everyone in the thread).
> I think I will go with nested lists.
> However, I am running into a conceptual problem.
> My approach will be firstly to remove all the impossible digits for a
>
anthonyberet wrote:
> Thanks for the advice (to everyone in the thread).
> I think I will go with nested lists.
> However, I am running into a conceptual problem.
> My approach will be firstly to remove all the impossible digits for a
> square by searching the row and column for other occurances.
anthonyberet wrote:
> Tim Chase wrote:
> >> I want to work on a sudoku brute-forcer, just for fun.
> >
> >
> > Well, as everybody seems to be doing these (self included...), the
> > sudoku solver may become the "hello world" of the new world :)
> >
> >> What is the equivalent way to store data in
Diez B. Roggisch schrieb:
> The question is not so much which region a give square is in, but more
> which square contains which fields. If we assume that you number your
> squares row-wise (top-left zero, top-right 3, bottom-right 9), this
> function computes the field indices that a given squa
> However, I wondering how to approach the search of the nine regions of
> the grid. I am thinking of producing another nested list, again 9x9 to
> store the contents of each region, and to update this after each pass
> through -and update of- the main grid (row and column).
>
> I am not sure h
From: anthonyberet
Date: 02/18/06 17:11:01
To: python-list@python.org
Subject: Re: 2-dimensional data structures
I am not sure how to most efficiently identify which region any given
square on the grid is actually in - any thoughts, for those that have
done this? - I don't w
Tim Chase wrote:
>> I want to work on a sudoku brute-forcer, just for fun.
>
>
> Well, as everybody seems to be doing these (self included...), the
> sudoku solver may become the "hello world" of the new world :)
>
>> What is the equivalent way to store data in python? - It isn't obvious
>> to
On 2006-01-26, Larry Bates <[EMAIL PROTECTED]> wrote:
>> I want to work on a sudoku brute-forcer, just for fun.
>>
>> I am considering different strategies, but first I need to decide on the
>> data-structure to use for the progress/solution grid.
>>
>> This being a square, I would have used a 9
Claudio Grondi wrote:
> anthonyberet wrote:
>> Hello again - rather a newbie here...
>> I am considering different strategies, but first I need to decide on
>> the data-structure to use for the progress/solution grid.
>
> ... define your grid as a dictionary in a following way:
> grid = {}
> for
Claudio Grondi wrote:
>
> Another approach as already proposed could be, that you define your grid
> as a dictionary in a following way:
> grid = {}
> for column in range(1,10):
> for row in range(1,10):
> grid[(column, row)] = None
> # then you can refer to the cells of the 'array' like:
>
anthonyberet wrote:
> Hello again - rather a newbie here...
>
> I want to work on a sudoku brute-forcer, just for fun.
>
> I am considering different strategies, but first I need to decide on the
> data-structure to use for the progress/solution grid.
>
> This being a square, I would have used
> I want to work on a sudoku brute-forcer, just for fun.
Well, as everybody seems to be doing these (self included...),
the sudoku solver may become the "hello world" of the new world :)
> What is the equivalent way to store data in python? - It isn't obvious
> to me how to do it with lists.
S
anthonyberet wrote:
> Hello again - rather a newbie here...
>
> I want to work on a sudoku brute-forcer, just for fun.
>
> I am considering different strategies, but first I need to decide on the
> data-structure to use for the progress/solution grid.
>
> This being a square, I would have used a
anthonyberet wrote:
> Hello again - rather a newbie here...
>
> I want to work on a sudoku brute-forcer, just for fun.
I know what you mean. I wrote one just for fun too.
> I am considering different strategies, but first I need to decide on the
> data-structure to use for the progress/solution
anthonyberet wrote:
> Hello again - rather a newbie here...
>
> I want to work on a sudoku brute-forcer, just for fun.
>
> I am considering different strategies, but first I need to decide on the
> data-structure to use for the progress/solution grid.
>
> This being a square, I would have used a 9
Hello again - rather a newbie here...
I want to work on a sudoku brute-forcer, just for fun.
I am considering different strategies, but first I need to decide on the
data-structure to use for the progress/solution grid.
This being a square, I would have used a 9x9 2-dimensional array in my
tee
16 matches
Mail list logo
