algorithmcollision-detectionsimulationagentagent-based-modeling
Predator-prey simulation
I'm trying to implement a model of predator-prey. It is agent-based model. Every few milliseconds is a new move. On the field there are two types of creatures: predator and prey. The behavior of each of them is given by the following rules:
Prey:
- Just moved to an unoccupied cell
- Every few steps creates offspring to his old cell
- Life expectancy is limited by the number of moves
Predator:
- Predator moves to the cell with prey. If such cells are not, in any free neighboring cell
- Same
- Same
I have a problem with the choice of prey move.
For example, I have preys in cells 5 and 9. Each of them can move to cell 6. How can I resolve this conflict? Thanks
Solution
Use asynchronous updating. Iterate through the prey in random order, having them decide in turn to which cell they should move.
This is a common approach in simulations. It has an additional benefit in that it eliminates limit cycles in the dynamics.
- Fastest sort of fixed length 6 int array
- Can hash tables really be O(1)?
- Number of ways to tile a W x H Grid with 2 x 1 and 1 x 2 dominos?
- Brent's cycle detection algorithm
- Is it possible to reduce number of comparisons from O(N^2) to O(N) in brute-force sorting by using multiplication?
- Mathematical explanation of Leetcode question: Container With Most Water
- manhattan skyline cover failing some test cases
- Algorithm for Determining Tic Tac Toe Game Over
- How to show a sodoku solution is unique
- Counting the number of positive integers that are lexicographically smaller than a specific number
- How to analyze time complexity of an algorithm with different running time
- What is the most efficient way of finding all the factors of a number in Python?
- A good way to find a vector perpendicular to another vector?
- Find the max average subarray with length at least k
- What is the complexity of the sorted() function?
- Minimum number of operations for array of numbers to all equal one number
- Implementation for a Monotonic Increasing Queue
- Java, Shifting Elements in an Array
- Differences between backtracking and brute-force search
- Number of partition of `n` into sum of three squares (fast algorithm)
- Big Number Subtraction in C
- If the n-body problem is chaotic, why isn't it used as a RNG?
- Using BFS for Weighted Graphs
- Removing a node in an undirected graph that destroys a path between two other nodes
- Binary search function is correct but it returns undefined
- Algorithm to reverse an array/string only in terms of rotate operations
- Correctness of Deletion algorithm of BST in CLRS
- Time Complexities n(log(n)) and log(n^n)
- How do I find the closest possible sum of an array's elements to a particular value?
- Split on regex (more than a character, maybe variable width) and keep the separator like GNU awk