jinnaiyuu / combinatorial_instances

Instance generators for combinatorial search domains: 15-puzzle, 24-puzzle, grid-pathfinding, multiple sequenece alignment

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Benchmark Instances

This is a repository for combinatorial search domain instances. 15-puzzle, 24-puzzle, grid-pathfinding, travelling salesperson problem (TSP), and multiple sequence alignment (MSA).

15-puzzle includes randomly generated instances and Korf's puzzle. 24-puzzle includes randomly generated instances. Grid-pathfinding is randomly generated. TSP is randomly generated. Multiple sequence alignment includes randomly generated instances and real aminos from BAliBASE 3.0.

Instance generators

Instance generators are in *-gen directories. Generators for Sliding-tile puzzle and grid-pathfinding are coded by the PBNF authors. Yuu Jinnai coded TSP and MSA.

LICENSE

Modified at 2016 by Yuu Jinnai Copyright © 2014 the PBNF Authors

This is the source code for PBNF and the algorithms described in: Ethan Burns, Sofia Lemons, Wheeler Ruml and Rong Zhou, "Best-First Heuristic Search for Multicore Machines", Journal of Artificial Intelligence Research, volume 39, pages 689-743, 2010.

About

Instance generators for combinatorial search domains: 15-puzzle, 24-puzzle, grid-pathfinding, multiple sequenece alignment

License:MIT License


Languages

Language:Roff 99.9%Language:Python 0.0%Language:C++ 0.0%Language:Shell 0.0%Language:C 0.0%