I will try again to explain what is required.
With regard to the von Neumann neighbourhood
It outputs an array which are the cells West, North, East and South every
[ these are the correct cells ]
My single active agent takes the first one of these which is null and
spawns one child into that cell and then moves into that child agent cell
becoming the active agent.
Each time we move into a new active agent we repeat the von Neumann
selection process and spawn a new child until we reach a cell where all of
the von Neumann neighbours are occupied.
This works perfectly including the boundary interaction with the exception
of the condition where the four cells are occupied.
Your method even works correctly when I change the distance to 2, 4 or 8
which are The connection distances on a Xilinx FPGA this is the underlying
purpose of the Agents. I have output a single pass of each of these and
Identified the cell placement order is correct.
I need a method which allows me to check if the four cells are occupied and
if so pause the run a bit like a checkpoint.
Then I would like to record in a file the number of cells occupied, [I have
done this ]
clear the grid of these cells and then continue with a further run with a
new start point
[ basically the last cell of the previous run ] repeating a few times.
I have a version where I checkpoint each run but you previously suggested
that I should be able to run a few times and just checkpoint after say half
of the runs.
I know that If I can identify the four occupied cells and can pause the
schedule this will solve my immediate problem.
Clearing the cells and restarting are my second problem.
Is there a way I can do the first if not the second.
On 31 July 2015 at 15:36, Sean Luke <[log in to unmask]> wrote:
> Stewart, I am afraid to say that your description so far has not been
> specific enough to describe what the intended behavior is, nor what the
> incorrect behavior is; and the pictures and code you're provided indicate
> that your model is likely too complex for me to be of much use. It is
> entirely possible that there's a bug in (say), MASON's neighborhood lookup
> functions. But to help you any further, I'd need a functioning, stripped
> down and simplified example.
> Other routes you could take:
> (1) print out what MASON is providing in its x and y bags for
> neighborhoods. Does anything look amiss?
> (2) instead of using MASON's neighborhood lookup function, why not just
> compute the four locations yourself? It'll be much faster. And then you
> can compare it against what MASON is providing.
> On Jul 31, 2015, at 4:30 PM, Stewart Aitken <[log in to unmask]> wrote:
> > Yes still has the bug.
> > It may be that MASON can't do what I am trying to do with it.
> > Kind regards,
> > Stewart Aitken.
> > On 31 July 2015 at 15:22, Sean Luke <[log in to unmask]> wrote:
> > By this you mean that it still has the error?
> > On Jul 31, 2015, at 3:29 PM, Stewart Aitken <[log in to unmask]> wrote:
> > > Thanks Sean,
> > >
> > > I have changed those two lines by removing the mySpace.tx and it works
> as before.
> > --
> > EMAIL DISCLAIMER http://www.york.ac.uk/docs/disclaimer/email.htm
EMAIL DISCLAIMER http://www.york.ac.uk/docs/disclaimer/email.htm