Computational Model Library

Boyds (NetLogo): Boids That Fight (1.0.0)

Boyds (Boids that Fight) is an agent-based model in NetLogo that extends the classic Flocking model with multi-faction competition, a local fight–flight heuristic, and a target locking/“taking” mechanism. The model separates perception (vision) from engagement range (lock distance) and uses per-faction steering bounds to explore how local numerical superiority, sensing, and bounded turning affect victory, losses, and emergent formations.

BoydsDemoImage.png

Release Notes

This is the initial public release of Boyds on CoMSES. The model was originally written for the CAS-520: Agent-Based Modeling course at Arizona State University’s School of Complex Adaptive systems, taught in Spring 2025 by Sean Bergin. The present release has only minor modifications for CoMSES compliance and user-friendliness.

Associated Publications

Boyds (NetLogo): Boids That Fight 1.0.0

Submitted by Oliver M. Haynold Published Jan 20, 2026 Last modified Jan 20, 2026
agent-based modeling NetLogo boids flocking multi-faction competition collective behavior collective motion swarm intelligence multi-agent systems conflict combat modeling pursuit-evasion target locking fight-flight emergent behavior numerical superiority alignment-cohesion-separation

Boyds (Boids that Fight) is an agent-based model in NetLogo that extends the classic Flocking model with multi-faction competition, a local fight–flight heuristic, and a target locking/“taking” mechanism. The model separates perception (vision) from engagement range (lock distance) and uses per-faction steering bounds to explore how local numerical superiority, sensing, and bounded turning affect victory, losses, and emergent formations.

Release Notes

This is the initial public release of Boyds on CoMSES. The model was originally written for the CAS-520: Agent-Based Modeling course at Arizona State University’s School of Complex Adaptive systems, taught in Spring 2025 by Sean Bergin. The present release has only minor modifications for CoMSES compliance and user-friendliness.

Cite this Model

Oliver M. Haynold (2026, January 20). “Boyds (NetLogo): Boids That Fight” (Version 1.0.0). CoMSES Computational Model Library. Retrieved from: https://doi.org/10.25937/z56b-3291

Replication of a previously described model

This model extends the Flocking model included in NetLogo. (U. Wilensky. NetLogo Flocking model. As included with NetLogo 4.6.0. 1998. url: http:
//ccl.northwestern.edu/netlogo/models/Flocking) With only one faction populated, it should produce identical behavior to Flocking.

References

Craig W. Reynolds. “Flocks, herds and schools: A distributed behavioral model”. In: Comput. Graph. (ACM) 21.4 (Aug. 1987), pp. 25–34.
U. Wilensky. NetLogo Flocking model. As included with NetLogo 4.6.0. 1998. url: http://ccl.northwestern.edu/netlogo/models/Flocking.

Create an Open Code Badge that links to this model more info

This model has been reviewed by CoMSES Net and meets the Open Code Badge guidelines.
You can use the following HTML or Markdown code to create an Open Code Badge that links to version 1.0.0 of this computational model. 

<a href="https://doi.org/10.25937/z56b-3291">
  <img height="100" src="https://www.comses.net/static/images/icons/open-code-badge.svg" alt="Open Code Badge">
</a>


[![Open Code Badge](https://www.comses.net/static/images/icons/open-code-badge.svg)](https://doi.org/10.25937/z56b-3291)
Contributors
Oliver M. Haynold
DOI

10.25937/z56b-3291

Model Version
1.0.0
License
GPL-3.0
Programming Language
Netlogo 6
Software Framework
Netlogo 6
Operating System
Operating System Independent
Publish Date
Tuesday, January 20, 2026
Last Updated
Tuesday, January 20, 2026
Downloads 0
Peer Reviewed
Open Code Badge
Version Submitter First published Last modified Status
1.0.0 Oliver M. Haynold Tue Jan 20 05:01:06 2026 Tue Jan 20 05:01:26 2026 Published Peer Reviewed DOI: 10.25937/z56b-3291

Discussion

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept