This HTML5 document contains 27 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
n2	https://kar.kent.ac.uk/id/eprint/
n16	https://kar.kent.ac.uk/69595/
wdrs	http://www.w3.org/2007/05/powder-s#
dc	http://purl.org/dc/elements/1.1/
n9	http://purl.org/ontology/bibo/status/
rdfs	http://www.w3.org/2000/01/rdf-schema#
n12	https://kar.kent.ac.uk/id/subject/
n14	https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n6	doi:10.1109/
n10	http://eprints.org/ontology/
n20	https://kar.kent.ac.uk/id/event/
bibo	http://purl.org/ontology/bibo/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n4	https://kar.kent.ac.uk/id/
n11	https://kar.kent.ac.uk/id/document/
xsdh	http://www.w3.org/2001/XMLSchema#
n17	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n19	https://kar.kent.ac.uk/id/person/
n8	https://kar.kent.ac.uk/id/eprint/69595#

Statements

Subject Item

n2:69595

rdf:type

bibo:AcademicArticle n10:ConferenceItemEPrint n10:EPrint bibo:Article

rdfs:seeAlso

n16:

owl:sameAs

n6:SSCI.2018.8628626

n10:hasAccepted

n11:3132894

n10:hasDocument

n11:3132894 n11:3153510 n11:3132898 n11:3153511 n11:3153512 n11:3153513

dc:hasVersion

n11:3132894

dcterms:title

Solving the Rubik’s Cube with Learned Guidance Functions

wdrs:describedby

n14:export_kar_RDFN3.n3 n17:export_kar_RDFN3.n3

dcterms:date

2019-01-31

dcterms:creator

n19:ext-c.g.johnson@kent.ac.uk

bibo:status

n9:peerReviewed n9:published

bibo:abstract

This paper introduces move sequence problems— problems where a system can exist in a number of states, including a goal state, with moves between those states. This paper introduces Learned Guidance Functions (LGFs) as a machine learning method to tackle these. An LGF is a function learned by supervised machine learning that predicts how far a particular state is from the goal state. These methods are applied to the challenging problem of unscrambling a Rubik’s Cube.

dcterms:isPartOf

n4:repository

dcterms:subject

n12:QA76.87 n12:QA76

bibo:authorList

n8:authors

bibo:presentedAt

n20:ext-c3125c88b2babd402e9060683063585f