For a 0,1,2,3 4,...n representation of the board, I take it?
Thanks.
Michael
On Tue, Jun 6, 2017 at 10:18 AM, Henry Rich wrote:
> I use
>
> setintersect =: e. # [
>
> Henry Rich
>
>
> On 6/6/2017 6:11 AM, 'Mike Day' via Programming wrote:
>
>> My point being, if Michael Rice is exploring how
I use
setintersect =: e. # [
Henry Rich
On 6/6/2017 6:11 AM, 'Mike Day' via Programming wrote:
My point being, if Michael Rice is exploring how to solve peg solitaire,
it's often useful to work on small(er) problems, before perhaps getting
stuck in a long loop, or seeing the memory climb and
No.
solitaire 0 10 14
i.e., positions 0 10 and 14 empty.
On Tue, Jun 6, 2017 at 9:18 AM, Raul Miller wrote:
> I'm not sure I understand your opening comment here.
>
> Specifically:
>
>solitaire 0
> 14 13 12
> 11 12 13
> 3 7 12
> 10 6 3
> 13 12 11
> 9 8 7
> 1 3 6
> 5 4 3
> 11
I'm not sure I understand your opening comment here.
Specifically:
solitaire 0
14 13 12
11 12 13
3 7 12
10 6 3
13 12 11
9 8 7
1 3 6
5 4 3
11 7 4
6 3 1
0 2 5
5 4 3
3 1 0
solitaire 10
14 9 5
2 5 9
12 8 5
9 5 2
10 11 12
13 12 11
1 4 8
11 7 4
6 3 1
Several screens don't fit my computer screen. The edit form extends below
the bottom which I resize it to fit. The dissect form extends beyond the
bottom of the screen as well. I can resize them, but it is an
inconvenience. I edited edit in config/qtide.cfg ide to get it to fit. But
that has to be
For a starting state of positions 0 10 and 14 empty, I can hear my AMD
FX-8320's fan crank up for about 10 second before returning "No Solution."
The base example for my peg solitaire endeavors was from "Prolog By
Example" by Coelho & Cotta, pg. 132.
Here's a nice presentation of representing the
Oops, I did my name recognition fail where I stopped paying attention
after the first letter. Sorry about that.
Meanwhile, (and perhaps distantly related?) I would not worry about
performing a unique after every intersection because if the underlying
representation already deals in unique elements
My point being, if Michael Rice is exploring how to solve peg solitaire,
it's often useful to work on small(er) problems, before perhaps getting
stuck in a long loop, or seeing the memory climb and one's pc seize up
and need rebooting.
But he'll know all this stuff anyway!
BTW, re Raul's usefu
On Tue, Jun 6, 2017 at 4:09 AM, 'Mike Day' via Programming
wrote:
> if I were developing a solver for solitaire, I'd include a variable as a
> parameter for
>
> the size of problem, eg the number of rows, 1 2 3 etc, or the ravel-size,
> eg 1 3 6 etc.
You had not specified that previously, but
The problem with "union" and "intersection" is that they operate on
sets, and J has several different good ways of representing sets,
including:
(*) As a sequence of [unique] values
(*) As a bit vector (against a sequence representing the reference universe)
This leads to the following different
FWIW - not much, here, as it isn't relevant to factorial, and on
investigation, not
something used in Mr Rice's LISP example, but, as Raul's posted a verb
for "union",
I've sometimes wondered why J doesn't include primitives for union and
intersection.
As I sometimes need intersection, here'
11 matches
Mail list logo
