South Africa’s biggest forum. Discuss, discover, and connect with thousands of members.
Ooooooooh. Philosophy of the Mind, here we go again. I remember about writing a paper on the whole "Ghost in the machine" issue during my second year. Was actually quite interesting. Now that I think about it, ALICE was also mentioned somewhere in one of my lectures. How long has ALICE been around for?
so you guys ask me whether or not I can make this "neural network", and whether I can implement "ADT" and whatnot but when I ask you guys to do it then you both go silent?
go figure....
/Cheers on Keeper
Anyway, did you see my post on Neural Networks?
Keeper said:
yes, and it was confusing to say the least.
how the heck do I decipher this one:
m
ÎŁbias+(W^i X^i)
i=1
yes, and it was confusing to say the least.
how the heck do I decipher this one:
m
ÎŁbias+(W^i X^i)
i=1
Anyone here interested in neural networks? C'mon, where's all the CompSci guys? sn3rd? semaphore?
I've tried my hand at proper AI development and subsequently gave up...
Wrote an implementation of the Animal Guessing Game using a Generic Binary Tree in C#.
You can get the executable here
And the source code here
It's a really basic implementation, and the some of the code is a bit dodgy, so don't expect much I wrote it while watching the cricket today
I have already started my planning of the way the AI would work, and so far have the basic structure.
actual coding to start soon....
#include <stdio.h>
#include <cstdlib>
#include <math.h>
#include <iostream>
#include <string>
#define POPULATION_SIZE 10000
#define CROSSOVER_RATE 0.8
#define MUTATION_RATE 0.0
using namespace std;
void recombine(string* parent1, string* parent2, string* child1, string* child2)
{
(*child1) = (*parent1);
(*child2) = (*parent2);
double randomResult;
randomResult = (rand() % 10) / 10;
if (randomResult < CROSSOVER_RATE)
{
char tempChar = 0;
int recombineLocus = (rand() % (*parent1).length());
for ( int i = recombineLocus ; i < (*parent1).length() ; i++ )
{
tempChar = (*child1)[i];
(*child1)[i] = (*child2)[i];
(*child2)[i] = tempChar;
}
}
randomResult = (rand() % 10) / 10;
if (randomResult < MUTATION_RATE * 2)
{
for ( int i = 0 ; i < (*parent1).length() ; i++ )
{
randomResult = (rand() % 10) / 10;
if (randomResult < (MUTATION_RATE * 2)/2)
{
(*child1)[i] = ((char)(48 + (rand() % 75)));
break;
}
if (randomResult < (MUTATION_RATE * 2) && randomResult > (MUTATION_RATE * 2)/2)
{
(*child1)[i] = ((char)(48 + (rand() % 75)));
break;
}
}
}
randomResult = (rand() % 10) / 10;
if (randomResult < MUTATION_RATE * 2)
{
for ( int i = 0 ; i < (*parent1).length() ; i++ )
{
randomResult = (rand() % 10) / 10;
if (randomResult < (MUTATION_RATE * 2)/2)
{
(*child2)[i] = ((char)(48 + (rand() % 75)));
break;
}
if (randomResult < (MUTATION_RATE * 2) && randomResult > (MUTATION_RATE * 2)/2)
{
(*child2)[i] = ((char)(48 + (rand() % 75)));
break;
}
}
}
}
int main(int argc, char* argv[])
{
if (argc != 2)
{
cout << "Usage: " << argv[0] << " <solution>" << endl;
return 1;
}
string solution(argv[1]);
string temporary("");
string population[POPULATION_SIZE];
int fitness[POPULATION_SIZE];
for ( int i = 0 ; i < POPULATION_SIZE ; i++ )
{
temporary.erase(0);
for ( int j = 0 ; j < solution.length() ; j++ )
{
temporary = temporary + ((char)(48 + (rand() % 75)));
}
population[i] = temporary;
}
int generation = 1;
while (true)
{
for ( int i = 0 ; i < POPULATION_SIZE ; i++ )
{
fitness[i] = 0;
for ( int j = 0 ; j < solution.length() ; j++ )
{
fitness[i] = fitness[i] + abs(solution.c_str()[j] - population[i].c_str()[j]);
}
}
for ( int i = 0 ; i < POPULATION_SIZE - 1 ; i++ )
{
for ( int j = i ; j < POPULATION_SIZE ; j++ )
{
if (fitness[i] < fitness[j])
{
int tempFitness = fitness[j];
fitness[j] = fitness[i];
fitness[i] = tempFitness;
string tempIndividual = population[j];
population[j] = population[i];
population[i] = tempIndividual;
}
}
}
for ( int i = 0 ; i < POPULATION_SIZE - 1 ; i++ )
{
recombine(&population[POPULATION_SIZE - i - 1], &population[POPULATION_SIZE - i - 2], &population[i], &population[i+1]);
}
cout << generation++ << " " << population[0] << " " << fitness[POPULATION_SIZE-1] << endl;
if (population[0] == solution)
{
break;
}
}
return 0;
}that's pretty cool - i like it! did you code it in one day?
sn3rd said: