I am building a kind of cellular automata and I have a matrix and I would like to choose a random neighbour of a random position, the following is the way I found I wonder if there is a better more efficient way of doing it: fil = 10 col = 10 m = zeros(Int16,fil,col) m[:,1] .= 1 neighborhood = ((…

[image] lsaravia: x=[i,j] .+ rand(neighborhood) This allocates an array [i,j] on every iteration. Better to use a tuple (i,j) .+ rand(neighborhood). [image] lsaravia: # check boundaries if !(x[1] > fil || x[1] <1 || x[2] > col || x[2]<1) I would usually recommend employing ghost cel…

Thanks! is there an example of how to implement ghost cells? Anyways that would work for closest neighbours if I have a function that gives a random position with an arbitrary maximum distance e.g. x=(i,j) .+ rand_max_distance(fil) will be more difficult to avoid boundary checks, and something…

[image] lsaravia: Thanks! is there an example of how to implement ghost cells? The “ghost cells” link above has an example. Here is another example, and here is another.

A better way to chose a random neighbor

New to Julia

stevengj May 12, 2022, 11:05pm 4

The “ghost cells” link above has an example. Here is another example, and here is another.

Topic		Replies	Views
Optimal way of checking neighboring elements in matrix New to Julia indexing	3	1889	October 28, 2019
Creating looping matrixes (Torus-like) with type inheritance General Usage type , inheritance , matrix	7	253	February 18, 2026
Arrays with periodic boundaries New to Julia	5	6856	June 30, 2022
Reducing allocations in a stencil function Performance	6	348	September 24, 2022
Cell list algorithm is slower than double for loop Performance	18	2406	April 2, 2020

A better way to chose a random neighbor

Related topics