most citedExploring Dynamic Difficulty Adjustment in Videogames

31 citations · 33 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2020★ 1 cited

Introduction to Behavior Algorithms for Fighting Games

Ignacio Gajardo, Felipe Besoain, Nicolas A. Barriga

The quality of opponent Artificial Intelligence (AI) in fighting videogames is crucial. Some other game genres can rely on their story or visuals, but fighting games are all about…

cs.AI2020★ 31 cited

Exploring Dynamic Difficulty Adjustment in Videogames

Gabriel K. Sepulveda, Felipe Besoain, Nicolas A. Barriga

Videogames are nowadays one of the biggest entertainment industries in the world. Being part of this industry means competing against lots of other companies and developers, thus,…

cs.AI2009

Single-Agent On-line Path Planning in Continuous, Unpredictable and Highly Dynamic Environments

Nicolas A. Barriga

This document is a thesis on the subject of single-agent on-line path planning in continuous,unpredictable and highly dynamic environments. The problem is finding and traversing a…

cs.AI2009★ 1 cited

Combining a Probabilistic Sampling Technique and Simple Heuristics to solve the Dynamic Path Planning Problem

Nicolas A. Barriga, Mauricio Araya-López, Mauricio Solar

Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be very…

cs.AI2009

A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning

Nicolas A. Barriga, Mauricio Araya-López

Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be effic…