Skip to content

small program made for an AI class, which runs the simulated annealing algorithm to search for the best seating arrangement giving the preference values for guests.

cemondr/dinnertablesearch

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 

Repository files navigation

dinnertablesearch

This program takes an input matrix that represents the guests feelings towards other guests and uses these values as heuristics to find the best possible seating chart.

How to use this program:

Compile from the main directory by:

javac src/dinnerTable.java

use .txt files in tests folder when running

java src/dinnerTable.java tests/hw1-inst1.txt

About

small program made for an AI class, which runs the simulated annealing algorithm to search for the best seating arrangement giving the preference values for guests.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages