sasarpillsa-storage

Anything not currently being worked on is placed here

rating: 0+x
Link To Guide
Item#:XXXX
Clearance Level 3: Clearance
Containment Class: euclid
euclid-icon.svg
Secondary Class: thaumiel
thaumiel-icon.svg
Disruption Class: #/dark
dark-icon.svg
Risk Class: #/notice
notice-icon.svg
pigeon_tsp.jpg

Flight #7. SCP-XXXX-1 is the blue point, while other coordinates are red. Black line traces the flight path of SCP-XXXX-2-7, moving clockwise. Hover to enlarge.

Special Containment Procedures: Evidence of SCP-XXXX-2 instances are to be removed from non-Foundation satellite data. Reports of unusual flight patterns in birds coinciding with SCP-XXXX-2 instance flight paths are to be discredited.

Incapacitated SCP-XXXX-2 instances are to be recovered.

A Foundation owned private ranch has been established around SCP-XXXX-1.

Description: SCP-XXXX-1 is a homing pigeon post in West Virginia.

Pigeons launched from SCP-XXXX-1 are designated as SCP-XXXX-2 instances.

SCP-XXXX is the phenomenon where SCP-XXXX-2 instances will correctly solve the most optimal solution of the Travelling Salesman Problem1 (TSP). The specific TSP parameters are dependent on the list of GPS coordinates displayed to the SCP-XXXX-2 instance before its flight, where each GPS coordinate (including SCP-XXXX-1's coordinates) is a node, and the edge weight of between each node is the coordinate's geographical distance.

After the SCP-XXXX-2 recognizes the GPS coordinate list, it will then travel to each coordinate2, then back to SCP-XXXX-1. The order of coordinates visited will always follow the optimal solution for the TSP corresponding to its list.

The time needed for a SCP-XXXX-2 instance to demonstrate a TSP solution is limited by its speed3. For a TSP with a small number of points, computers solve it significantly faster than a SCP-XXXX-2 instance. However, as the number of points grow, solving time for a SCP-XXXX-2 instance grows linearly compared to the factorial growth for computers, resulting in SCP-XXXX being more efficient for large and complex problems.

The limit of points SCP-XXXX-2 instances can calculate has no known upper bound, allowing for computations some Foundation computers cannot perform. The method SCP-XXXX-2 instances read the coordinates and calculate the most optimal path is unknown.

Discovery: Foundation webcrawlers notified personnel about a possible anomalous sighting on an anonymous imageboard, posted early 2000. Select contents of relevant posts are shown below.

So, I just found something while messing around with live satellite data. Check out this place on the outskirts of Monongahela and look if you can see birds coming out of it. They were moving in all sort of weird shapes, patterns I couldn't really identify as normal birds. Maybe it's some military projects or drones, weird if they won't tell satellites to not hide this.

Yo, I looked at it and it's freaky. I know a guy who lives near there and I asked him if he could take a look nearby. It's pigeons basically. Weird.

Pigeons don't move like that, pretty sure it's drones.

Foundation personnel were deployed to investigate, discovering an abandoned SCP-XXXX-1, save for 14 pigeons. Multiple scraps of paper containing GPS coordinates4 were found inside the pigeonholes and on the ground. Launching effects of SCP-XXXX were discovered when personnel placed a sample paper inside an occupied pigeonhole.

Foundation researchers discovered the calculation effect of SCP-XXXX after a studying a case using 1000 GPS coordinates, tested against an exhaustive search algorithm.

Addendum: Given the use cases that an exact solution to any mathematical problem convertible to the Traveling Salesman Problem5 will serve, the Waitzman Protocol is currently being developed.

A non exhaustive list of the Waitzman Protocol applications follows:

SCP Placement Optimal placement of SCPs to minimize danger during a breach, using a modified form of the edge coloring problem6 denoting risk between SCPs.
Foundation AI Assists in creation of training data for AI, offering the exact solution of a problem as a benchmark.
Biological analysis Discover exact DNA differences between biological SCPs and non-anomalous relatives by discovering the similarities between DNA strings.
Space travel routing Classic example of the Travelling Salesman Problem, discovers the shortest routes for extra solar expeditions. Waitzman Protocol discovered routes are significantly shorter than navigation AI routes.

image credits
Two images, both edited together by me

pigeon_tsp.jpg
Edited using these two pictures

Map
Source: OpenStreetMap
License: CC BY-SA
Release year: 2020

Travelling Salesman Nodes
Source: Wikipedia Commons by Xypron
License: Public Domain
Release year: 2010


The rest below is broken here due to nested collapsibles, but aren't intended to be viewed anyway


[[/collapsible]]