mgo.evolution.neat.NEATMinimalGenomeUnconnected.scala Maven / Gradle / Ivy
The newest version!
///*
// * Copyright (C) 2015 Guillaume Chérel
// *
// * This program is free software: you can redistribute it and/or modify
// * it under the terms of the GNU Affero General Public License as published by
// * the Free Software Foundation, either version 3 of the License, or
// * (at your option) any later version.
// *
// * This program is distributed in the hope that it will be useful,
// * but WITHOUT ANY WARRANTY; without even the implied warranty of
// * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// * GNU General Public License for more details.
// *
// * You should have received a copy of the GNU General Public License
// * along with this program. If not, see .
// */
//
//package mgo.evolution.genome
//
//import collection.immutable.IntMap
//import scala.util.Random
//
//import scalaz._
//import Scalaz._
//
//import NEATGenome._
//
//trait NEATMinimalGenomeUnconnected <: NEATInitialGenome {
//
// override def minimalGenome(implicit rng: Random): G = mg
//
// lazy val mg: G =
// Genome(
// connectionGenes = Seq[ConnectionGene](),
// nodes =
// IntMap(
// inputNodesIndices.map { _ -> newInputNode }
// ++ biasNodesIndices.map { _ -> newBiasNode }
// ++ outputNodesIndices.map { _ -> newOutputNode }.toSeq: _*),
// species = 0,
// lastNodeId = inputNodes + biasNodes + outputNodes - 1
// )
//
// def newInputNode: InputNode
// def newBiasNode: BiasNode
// def newOutputNode: OutputNode
//}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy