Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Rybka code

Author: Alessandro Scotti

Date: 08:15:13 12/12/05

Go up one level in this thread


On December 12, 2005 at 11:03:47, Zappa wrote:

>How can you tell?  And how on earth did you find it?
>
>anthony

Don't know what Chrilly is using, but there could be different methods. Here's a
piece of code... half-answer, half-puzzle... :-)

void unknown()
{
    FILE * f = fopen( "something.asm", "r" );

    if( f == 0 ) return;

    char proc[256];

    strcpy( proc, "" );

    int n = 0;

    while( 1 ) {
        char buf[256];
        char * line = fgets( buf, sizeof(buf), f );

        if( line == 0 ) break;

        n++;
        printf( "%d\r", n );

        buf[ sizeof(buf)-1 ] = 0;

        if( strstr( line, "endp" ) != 0 ) {
            proc[0] = 0;
        }
        else if( strstr( line, "proc" ) != 0 ) {
            char * x = strchr( line, '\t' );
            *x = 0;
            strcpy( proc, line );
        }
        else if( strstr( line, "call" ) != 0 ) {
            if( proc[0] && strstr( line, proc ) != 0 ) {
                printf( "\nFOUND: %s\n", proc );
            }
        }
    }

    fclose( f );
}



This page took 0.01 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.