arcvega / beach_house Goto Github PK
View Code? Open in Web Editor NEWA project which aims to simulate the environment stemming from the "Beach House Theory" proposed by Matthew Colbourne
License: Apache License 2.0
A project which aims to simulate the environment stemming from the "Beach House Theory" proposed by Matthew Colbourne
License: Apache License 2.0
To make the relations between between the three different agents more apparent, it may be a good idea to add a network which will help visualize the relations and connections
The random walk by the agents is incredibly localized (they don't stray far), it may be worth reworking this to make the exploration factor more extreme
Having a priority queue may be nice since rejections caused by a Jim
could make it harder for the rejected Matt
to get off of Casey
s blacklist, hence making rejection by Jim
more influential
Matt should be the one chasing Casey, which is not the case
It may be time to come up with some test cases which can be used to evaluate the correctness of the blacklist since doing this manually is rather strenuous and ineffective
Add the ability to tune hyperparameters such as population size for respective agents as a separate class, to prevent meddling with the Simulation class
It may be nice to introduce a repulsive force that acts on the pair when they escape Jim, so that they don't run towards him as can be the case when using a random walk
There are several methods in Casey and Matt which do the exact same thing apart from the cast used, ie. Matt casts partner to Casey and Casey casts her partner to the Matt class
Most of this could probably be solved by using Javas generic type and making these methods part of the Agent baseclass to eliminate code duplication
There appear to be cases where Casey doesn't remove the edge between herself and a coupled Matt.
This is probably happening when Casey steals a Matt, she uncouples with him but the graph edge between them is not deleted, so they are free to re-pair with other agents but they have a remnant edge connecting them
Currently, Matt
always picks the most attractive Casey and hence all matts will start to follow a single Casey instance, completely ignoring all other agents
The way the potential Casey is selected may need to be amended since the majority of Casey agents will remain unpaired indefinitely
Maybe the Matt
should first stick to a range of Casey
agents which are between his own score and the randomized standard
The affinity that is assigned to the agents should be done in accordance to a normal distribution, rather than equally distributed randomness
Casey is not using her own definition of the blacklist size CASEY_MAXIMUM_BLACKLIST_SIZE
, instead MATT_MAXIMUM_BLACKLIST_SIZE
is being used which is incorrect
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.